Welcome to D
SIGMOD 2004
PODS 2004
SIGMOD RECOR
CIKM 2004
DASFAA 2004
DBPL 2003
DE-BULLETIN
DEBS 2004
DMKD 2004
DMSN 2004
DOLAP 2004
DPDJ 2004
EDBT 2004
ER 2003
GIS 2004
HDP 2004
HYPERTEXT 20
ICDE 2004
ICDT 2003
JCDL 2004
MDM
MIR 2004
MIS 2004
MMDB 2004
MOBIDE 2003
RIDE 2004
SBBD 2003
SIGIR FORUM
SIGIR 2004
SIGKDD EXPLO
SIGKDD 2004
SSDBM 2004
SSTD 2003
TIME 2004
TODS 2004
VLDB 2004
VLDB Journal
WEBDB 2004
WIDM 2004
XIME-P 2004
Footer

Hanan Samet

Papers on DiSC'04


A Serverless 3D World

Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing

Maintenance of Spatial Semijoin Queries on Moving Points

Publications


Note: Links lead to the DBLP on the Web.

Hanan Samet

Egemen Tanin , Aaron Harwood , Hanan Samet: A Distributed Quadtree Index for Peer-to-Peer Settings. ICDE 2005 : 254-255

Gabriella Sanniti di Baja , Hanan Samet: Editorial. Pattern Recognition Letters 26 (3): 231-232 (2005)

Hanan Samet, Frantisek Brabec , Jagan Sankaranarayanan : Importing Abstract Spatial Data into the SAND Database System. DG.O 2004

Egemen Tanin , Aaron Harwood , Hanan Samet: Indexing Distributed Complex Data for Complex Queries. DG.O 2004

Hanan Samet, Egemen Tanin , Leana Golubchik : Scalable Data Collection Infrastructure for Digital Government Applications. DG.O 2004

Egemen Tanin , Aaron Harwood , Hanan Samet, Sarana Nutanong , Minh Tri Truong : A serverless 3D world. GIS 2004 : 157-165

Hanan Samet: Indexing Issues in Supporting Similarity Searching. PCM (2) 2004 : 463-470

Michael Lee , Leila De Floriani , Hanan Samet: Constant-Time Navigation in Four-Dimensional Nested Simplicial Meshes. SMI 2004 : 221-230

Glenn S. Iwerks , Hanan Samet, Ken Smith : Maintenance of Spatial Semijoin Queries on Moving Points. VLDB 2004 : 828-839

Hanan Samet: Object-based and image-based object representations. ACM Comput. Surv. 36 (2): 159-217 (2004)

Philip David , Daniel DeMenthon , Ramani Duraiswami , Hanan Samet: SoftPOSIT: Simultaneous Pose and Correspondence Determination. International Journal of Computer Vision 59 (3): 259-284 (2004)

Philip David , Daniel DeMenthon , Ramani Duraiswami , Hanan Samet: Simultaneous Pose and Correspondence Determination using Line Feature. CVPR (2) 2003 : 424-431

Glenn S. Iwerks , Hanan Samet: The internet spatial spreadsheet: enabling remote visualization of dynamic spatial data and ongoing query results over a network. GIS 2003 : 154-160

Hanan Samet: Depth-first k-nearest neighbor finding using the MaxNearestDist estimator. ICIAP 2003 : 486-491

Frantisek Brabec , Hanan Samet, Cemal Yilmaz : VASCO: visualizing and animating spatial constructs and operations. Symposium on Computational Geometry 2003 : 374-375

Glenn S. Iwerks , Hanan Samet, Ken Smith : Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates. VLDB 2003 : 512-523

Edwin H. Jacox , Hanan Samet: Iterative spatial join. ACM Trans. Database Syst. 28 (3): 230-256 (2003)

Gísli R. Hjaltason , Hanan Samet: Index-driven similarity search in metric spaces. ACM Trans. Database Syst. 28 (4): 517-580 (2003)

Gary Marchionini , Hanan Samet, Larry Brandt : Introduction. Commun. ACM 46 (1): 24-27 (2003)

Leana Golubchik , William C. Cheng , Cheng-Fu Chou , Samir Khuller , Hanan Samet, C. Justin Wan : Bistro: a scalable and secure data transfer service for digital government applications. Commun. ACM 46 (1): 50-51 (2003)

Hanan Samet, Houman Alborzi , Frantisek Brabec , Claudio Esperança , Gísli R. Hjaltason , Frank Morgan , Egemen Tanin : Use of the SAND spatial browser for digital government applications. Commun. ACM 46 (1): 61-64 (2003)

Gísli R. Hjaltason , Hanan Samet: Properties of Embedding Methods for Similarity Searching in Metric Spaces. IEEE Trans. Pattern Anal. Mach. Intell. 25 (5): 530-549 (2003)

Erik G. Hoel , Hanan Samet: Data-parallel polygonization. Parallel Computing 29 (10): 1381-1401 (2003)

Gísli R. Hjaltason , Hanan Samet: Improved search heuristics for the sa-tree. Pattern Recognition Letters 24 (15): 2785-2795 (2003)

Hanan Samet, Andrzej Kochut : Octree approximation and compression methods. 3DPVT 2002 : 460-469

Egemen Tanin , Frantisek Brabec , Hanan Samet: Remote access to large spatial databases. ACM-GIS 2002 : 5-10

Philip David , Daniel DeMenthon , Ramani Duraiswami , Hanan Samet: SoftPOSIT: Simultaneous Pose and Correspondence Determination. ECCV (3) 2002 : 698-714

Andre Folkers , Hanan Samet: Content-Based Image Retrieval Using Fourier Descriptors on a Logo Database. ICPR (3) 2002 : 521-524

Emanuele Danovaro , Leila De Floriani , Michael Lee , Hanan Samet: Multiresolution Tetrahedral Meshes: An Analysis and a Comparison (figures 4, 6, and 9). Shape Modeling International 2002 : 273

Emanuele Danovaro , Leila De Floriani , Michael Lee , Hanan Samet: Multiresolution Tetrahedral Meshes: An Analysis and a Comparison. Shape Modeling International 2002 : 83-94

Claudio Esperança , Hanan Samet: Experience with SAND-Tcl: A Scripting Tool for Spatial Databases. J. Vis. Lang. Comput. 13 (2): 229-255 (2002)

Jan Neumann , Hanan Samet, Aya Soffer : Integration of local and global shape analysis for logo classification. Pattern Recognition Letters 23 (12): 1449-1457 (2002)

Gísli R. Hjaltason , Hanan Samet: Speeding up construction of PMR quadtree-based spatial indexes. VLDB J. 11 (2): 109-137 (2002)

Hanan Samet: Issues, Developments, and Challenges in Spatial Databases and Geographic Information Systems (GIS). ACM-GIS 2001 : 1

Jan Neumann , Hanan Samet, Aya Soffer : Integration of Local and Global Shape Analysis for Logo Classification. IWVF 2001 : 769-778

Michael Lee , Hanan Samet, Leila De Floriani : Constant-Time Neighbor Finding in Hierarchical Tetrahedral Meshes. Shape Modeling International 2001 : 286-295

Arnon Amir , Alon Efrat , Piotr Indyk , Hanan Samet: Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems. Algorithmica 30 (2): 164-187 (2001)

Frantisek Brabec , Hanan Samet: Visualizing and Animating Search Operations on Quadtrees on the Worldwide Web. EWCG 2000 : 70-76

Andre Folkers , Hanan Samet, Aya Soffer : Processing Pictorial Queries with Multiple Instances Using Isomorphic Subgraphs. ICPR 2000 : 4051-4054

Glenn S. Iwerks , Hanan Samet: Visualization of Dynamic Spatial Data and Query Results Over Time in a GIS Using Animation. VISUAL 2000 : 166-177

Michael Lee , Hanan Samet: Navigating through triangle meshes implemented as linear quadtrees. ACM Trans. Graph. 19 (2): 79-121 (2000)

Gísli R. Hjaltason , Hanan Samet: Improved Bulk-Loading Algorithms for Quadtrees. ACM-GIS 1999 : 110-115

Glenn S. Iwerks , Hanan Samet: Integrating the Natural Environment into a GIS for Decision Support. ACM-GIS 1999 : 73-78

Aya Soffer , Hanan Samet: Two Data Organizations for Storing Symbolic Images in a Relational Database System. DS-8 1999 : 435-45x

Arnon Amir , Alon Efrat , Piotr Indyk , Hanan Samet: Efficient Regular Data Structures and Algorithms for Location and Proximity Problems. FOCS 1999 : 160-170

Charles Ben Cranston , Frantisek Brabec , Gísli R. Hjaltason , Douglas D. Nebert , Hanan Samet: Adding an Interoperable Server Interface to a Spatial Database: Implementation Experiences with OpenMap TM* . INTEROP 1999 : 115-128

Pedja Bogdanovich , Hanan Samet: The ATREE: A Data Structure to Support Very Large Scientific Databases. Integrated Spatial Databases 1999 : 235-248

Glenn S. Iwerks , Hanan Samet: The Spatial Spreadsheet. VISUAL 1999 : 317-324

Aya Soffer , Hanan Samet: Query Processing and Optimization for Pictorial Query Trees. VISUAL 1999 : 60-67

Gísli R. Hjaltason , Hanan Samet: Distance Browsing in Spatial Databases. ACM Trans. Database Syst. 24 (2): 265-318 (1999)

Gísli R. Hjaltason , Hanan Samet: Incremental Distance Join Algorithms for Spatial Databases. SIGMOD Conference 1998 : 237-248

Frantisek Brabec , Hanan Samet: Visualizing and Animating R-trees and Spatial Operations in Spatial Databases on the Worldwide Web. VDB 1998 : 123-140

Frantisek Brabec , Hanan Samet: The VASCO R-tree JAVA Applet. VDB 1998 : 147-153

Hanan Samet, Aya Soffer : MAGELLAN: Map Acquisition of GEographic Labels by Legend ANalysis. IJDAR 1 (2): 89-101 (1998)

Aya Soffer , Hanan Samet: Pictorial Query Specification for Browsing Through Spatially Referenced Image Databases. J. Vis. Lang. Comput. 9 (6): 567-596 (1998)

Claudio Esperança , Hanan Samet: Vertex representations and their applications in computer graphics. The Visual Computer 14 (5/6): 240-256 (1998)

Aya Soffer , Hanan Samet: Integrating Symbolic Images into a Multimedia Database System Using Classification and Abstraction Approaches. VLDB J. 7 (4): 253-274 (1998)

Gísli R. Hjaltason , Hanan Samet, Yoram J. Sussmann : Speeding up Bulk-Loading of Quadtrees. ACM-GIS 1997 : 50-53

Claudio Esperança , Hanan Samet: A Differential Code for Shape Representation in Image Database Applications. ICIP (1) 1997 : 556-559

Claudio Esperança , Hanan Samet: Orthogonal Polygons as Bounding Structures in Filter-Refine Query Processing Strategies. SSD 1997 : 197-220

Walid G. Aref , Hanan Samet: Efficient Window Block Retrieval in Quadtree-Based Spatial Databases. GeoInformatica 1 (1): 59-91 (1997)

Walid G. Aref , Hanan Samet: Cascaded Spatial Join Algorithms with Spatially Sorted Output. ACM-GIS 1996 : 17-24

Aya Soffer , Hanan Samet: Retrieval by Content in Symbolic-Image Databases. Storage and Retrieval for Image and Video Databases (SPIE) 1996 : 144-155

Michael B. Dillencourt , Hanan Samet: Using Topological Sweep to Extract the Boundaries of Regions in Maps Represented by Region Quadtrees. Algorithmica 15 (1): 82-102 (1996)

Hanan Samet, Aya Soffer : MARCO: MAp Retrieval by COntent. IEEE Trans. Pattern Anal. Mach. Intell. 18 (8): 783-798 (1996)

Walid G. Aref , Hanan Samet: A Window Retrieval Algorithm for Spatial Databases Using Quadtrees. ACM-GIS 1995 : 69-

Hanan Samet, Aya Soffer : A map acquisition, storage, indexing, and retrieval system. ICDAR 1995 : 992-996

Erik G. Hoel , Hanan Samet: Data-Parallel Primitives for Spatial Operations. ICPP (3) 1995 : 184-191

Gísli R. Hjaltason , Hanan Samet: Ranking in Spatial Databases. SSD 1995 : 83-95

Erik G. Hoel , Hanan Samet: Benchmarking Spatial Join Operations with Spatial Output. VLDB 1995 : 606-618

Hanan Samet, Walid G. Aref : Spatial Data Models and Query Processing. Modern Database Systems 1995 : 338-360

Hanan Samet: Spatial Data Structures. Modern Database Systems 1995 : 361-385

Hanan Samet: General Research Issues in Multimedia Database Systems. ACM Comput. Surv. 27 (4): 630-632 (1995)

Walid G. Aref , Hanan Samet: An Algorithm for Perspective Viewing of Objects Represented by Octrees. Comput. Graph. Forum 14 (1): 59-66 (1995)

Walid G. Aref , Hanan Samet: A Cost Model for Query Optimization Using R-Trees. ACM-GIS 1994 : 0-

Hanan Samet: Spatial Databases. ADB 1994 : 25

Walid G. Aref , Hanan Samet: Hashing by Proximity to Process Duplicates in Spatial Databases. CIKM 1994 : 347-354

Erik G. Hoel , Hanan Samet: Data-Parallel Spatial Join Algorithms. ICPP (3) 1994 : 227-234

Erik G. Hoel , Hanan Samet: Performance of Data-Parallel Spatial Operations. VLDB 1994 : 156-167

Chuan-Heng Ang , Hanan Samet: A fast quadtree normalization algorithm. Pattern Recognition Letters 15 (1): 57-63 (1994)

Walid G. Aref , Hanan Samet: Estimating Selectivity Factors of Spatial Operations. FMLDO 1993 : 31-43

Erik G. Hoel , Hanan Samet: Data-Parallel R-Tree Algorithms. ICPP 1993 : 47-50

Walid G. Aref , Hanan Samet: Decomposing a Window into Maximal Quadtree Blocks. Acta Inf. 30 (5): 425-439 (1993)

Kikuo Fujimura , Hanan Samet: Planning a Time-Minimal Motion Among Moving Obstacles. Algorithmica 10 (1): 41-63 (1993)

Erik G. Hoel , Hanan Samet: A Qualitative Comparison Study of Data Structures for Large Line Segment Databases. SIGMOD Conference 1992 : 205-214

Hanan Samet: Spatial Databases. VLDB 1992 : 221

Ekow J. Otoo , Ron Lake , Wo-Shun Luk , T. H. Merrett , Hanan Samet: Georgraphic Information Systems, A Challenge for the 90's (Panel). VLDB 1992 : 263

Robert E. Webber , Hanan Samet: Linear-Time Border-Tracing Algorithms for Quadtrees. Algorithmica 8 (1): 39-54 (1992)

Michael B. Dillencourt , Hanan Samet, Markku Tamminen : A General Approach to Connected-Component Labelling for Arbitrary Image Representations. J. ACM 39 (2): 253-280 (1992)

Michael B. Dillencourt , Hanan Samet, Markku Tamminen : Corrigenda: 'A General Approach to Connected-Component Labelling for Arbitrary Image Representations'. J. ACM 39 (4): 985-986 (1992)

Erik G. Hoel , Hanan Samet: Efficient Processing of Spatial Queries in Line Segment Databases. SSD 1991 : 237-256

Walid G. Aref , Hanan Samet: Extending a DBMS with Spatial Operations. SSD 1991 : 299-318

Hanan Samet: Why Does GIS Industry Ignore University Research? (Panel abstract). SSD 1991 : 471

Walid G. Aref , Hanan Samet: Optimization for Spatial Query Processing. VLDB 1991 : 81-90

Hanan Samet, Robert E. Webber : Data structures to support Bézier-based modelling. Computer-Aided Design 23 (3): 162-176 (1991)

Hanan Samet: The Design and Analysis of Spatial Data Structures Addison-Wesley 1990

Walid G. Aref , Hanan Samet: Efficient Processing of Window Queries in The Pyramid Data Structure. PODS 1990 : 265-272

Clifford A. Shaffer , Hanan Samet: Set Operations for Unaligned Linear Quadtrees. Computer Vision, Graphics, and Image Processing 50 (1): 29-49 (1990)

Chuan-Heng Ang , Hanan Samet, Clifford A. Shaffer : A New Region Expansion for Quadtrees. IEEE Trans. Pattern Anal. Mach. Intell. 12 (7): 682-686 (1990)

Clifford A. Shaffer , Hanan Samet, Randal C. Nelson : QUILT: A Geographic Information System based on Quadtrees. IJGIS 4 (2): 103-131 (1990)

Hanan Samet, Markku Tamminen : Approximating CSG trees of moving objects. The Visual Computer 6 (4): 182-209 (1990)

Hanan Samet: Hierarchical Spatial Data Structures. SSD 1989 : 193-212

Chuan-Heng Ang , Hanan Samet: Node Distribution in a PR Quadtree. SSD 1989 : 233-252

Hanan Samet: Implementing ray tracing with octrees and neighbor finding. Computers & Graphics 13 (4): 445-460 (1989)

Hanan Samet, Robert E. Webber : A comparison of the space requirements of multi-dimensional quadtree-based file structures. The Visual Computer 5 (6): 349-359 (1989)

Hanan Samet: Hierarchical Representations of Collections of Small Rectangles. ACM Comput. Surv. 20 (4): 271-309 (1988)

Hanan Samet, Markku Tamminen : Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees. IEEE Trans. Pattern Anal. Mach. Intell. 10 (4): 579-586 (1988)

Clifford A. Shaffer , Hanan Samet: Algorithm to expand regions represented by linear quadtrees. Image Vision Comput. 6 (3): 162-168 (1988)

Randal C. Nelson , Hanan Samet: A Population Analysis for Hierarchical Data Structures. SIGMOD Conference 1987 : 270-277

Hanan Samet, C. A. Shatter , Randal C. Nelson , Y.-G. Huang , Kikuo Fujimura , A. Rosenteld : Recent developments in linear quadtree-based geographic information systems. Image Vision Comput. 5 (3): 187-197 (1987)

Hanan Samet, Clifford A. Shaffer , Robert E. Webber : Digitizing the Plane with Cells of Nonuniform Size. Inf. Process. Lett. 24 (6): 369-375 (1987)

Hanan Samet, Robert E. Webber : Storing a Collection of Polygons Using Quadtrees. ACM Trans. Graph. 4 (3): 182-222 (1985)

Hanan Samet: Data Structures for Quadtree Approximation and Compression. Commun. ACM 28 (9): 973-993 (1985)

Hanan Samet: Bidirectional Coroutines. Inf. Process. Lett. 21 (1): 1-6 (1985)

Hanan Samet: The Quadtree and Related Hierarchical Data Structures. ACM Comput. Surv. 16 (2): 187-260 (1984)

Jack R. Buchanan , Richard D. Fennell , Hanan Samet: A Database Management System for the Federal Courts. ACM Trans. Database Syst. 9 (1): 72-88 (1984)

Hanan Samet: A Quadtree Medial Axis Transform. Commun. ACM 26 (9): 680-693 (1983)

Hanan Samet: Heuristics for the Line Divison Problem in Computer Justified Text. Commun. ACM 25 (8): 564-571 (1982)

Hanan Samet: Code Optimization Considerations in List Processing Systems. IEEE Trans. Software Eng. 8 (2): 107-112 (1982)

Hanan Samet: Connected Component Labeling Using Quadtrees. J. ACM 28 (3): 487-501 (1981)

Hanan Samet: Experience with Software Conversion. Softw., Pract. Exper. 11 (10): 1053-1069 (1981)

Hanan Samet: A Coroutine Approach to Parsing. ACM Trans. Program. Lang. Syst. 2 (3): 290-306 (1980)

Hanan Samet: Deletion in Two-Dimensional Quad Trees. Commun. ACM 23 (12): 703-710 (1980)

Hanan Samet: Region Representation: Quadtrees from Boundary Codes. Commun. ACM 23 (3): 163-170 (1980)

Charles R. Dyer , Azriel Rosenfeld , Hanan Samet: Region Representation: Boundary Codes from Quadtrees. Commun. ACM 23 (3): 171-179 (1980)

Hanan Samet: Efficient On-Line Proofs of Equalities and Inequalities of Formulas. IEEE Trans. Computers 29 (1): 28-32 (1980)

Hanan Samet, Leo Marcus : Purging in an Equality Data Base. Inf. Process. Lett. 10 (2): 89-95 (1980)

Hanan Samet: Deep and Shallow Binding: the Assignment Operation. Comput. Lang. 4 (3-4): 187-198 (1979)

Peter J. Downey , Hanan Samet, Ravi Sethi : Off-Line and On-Line Algorithms for Deducing Equalities. POPL 1978 : 158-170

Hanan Samet: Proving the Correctness of Heuristically Optimized Code. Commun. ACM 21 (7): 570-582 (1978)

Hanan Samet: A Canonical Form Algorithm for Proving Equivalence of Conditional Forms. Inf. Process. Lett. 7 (2): 103-106 (1978)

Hanan Samet: A New Approach to Evaluating Code Generation in a Student Environment. IFIP Congress 1977 : 661-665

Hanan Samet: Toward Automatic Debugging of Compilers. IJCAI 1977 : 379

Hanan Samet: A Machine Description Facility for Compiler Testing. IEEE Trans. Software Eng. 3 (5): 343-351 (1977)

1 [ 114 ]

2 [ 90 ] [ 98 ]

3 [ 32 ] [ 36 ] [ 55 ]

4 [ 38 ] [ 41 ] [ 43 ] [ 52 ] [ 54 ] [ 58 ] [ 60 ] [ 61 ] [ 64 ] [ 69 ] [ 73 ] [ 74 ]

5 [ 133 ]

6 [ 88 ]

7 [ 82 ] [ 83 ] [ 89 ] [ 97 ] [ 109 ] [ 114 ] [ 120 ] [ 132 ]

8 [ 116 ]

9 [ 19 ]

10 [ 115 ]

11 [ 115 ]

12 [ 89 ]

13 [ 105 ] [ 106 ]

14 [ 108 ] [ 123 ] [ 124 ]

15 [ 108 ] [ 123 ] [ 124 ]

16 [ 45 ] [ 46 ] [ 71 ]

17 [ 6 ]

18 [ 108 ] [ 123 ] [ 124 ]

19 [ 10 ]

20 [ 90 ] [ 98 ]

21 [ 75 ] [ 76 ] [ 79 ] [ 104 ] [ 114 ]

22 [ 19 ]

23 [ 99 ] [ 105 ] [ 106 ] [ 127 ]

24 [ 96 ] [ 107 ]

25 [ 25 ] [ 51 ]

26 [ 115 ] [ 130 ]

27 [ 129 ] [ 131 ] [ 134 ]

28 [ 66 ] [ 77 ] [ 84 ] [ 85 ] [ 89 ] [ 93 ] [ 102 ] [ 111 ] [ 113 ] [ 114 ] [ 117 ]

29 [ 44 ] [ 50 ] [ 53 ] [ 56 ] [ 57 ] [ 65 ] [ 67 ] [ 112 ]

30 [ 25 ]

31 [ 90 ] [ 98 ]

32 [ 87 ] [ 92 ] [ 95 ] [ 119 ] [ 122 ] [ 126 ]

33 [ 118 ]

34 [ 115 ]

35 [ 110 ]

36 [ 48 ]

37 [ 94 ] [ 99 ] [ 105 ] [ 106 ] [ 127 ]

38 [ 48 ]

39 [ 116 ]

40 [ 8 ]

41 [ 48 ]

42 [ 114 ]

43 [ 89 ]

44 [ 25 ] [ 26 ] [ 35 ]

45 [ 100 ] [ 103 ]

46 [ 129 ]

47 [ 48 ]

48 [ 10 ]

49 [ 25 ]

50 [ 132 ]

51 [ 6 ]

52 [ 24 ] [ 27 ] [ 35 ] [ 36 ] [ 37 ]

53 [ 25 ]

54 [ 119 ] [ 126 ]

55 [ 68 ] [ 70 ] [ 72 ] [ 78 ] [ 80 ] [ 81 ] [ 86 ] [ 91 ] [ 96 ] [ 100 ] [ 103 ]

56 [ 77 ]

57 [ 28 ] [ 34 ] [ 45 ] [ 46 ]

58 [ 109 ] [ 114 ] [ 129 ] [ 130 ] [ 131 ] [ 134 ]

59 [ 129 ]

60 [ 115 ]

61 [ 23 ] [ 24 ] [ 30 ] [ 40 ] [ 47 ]

62 [ 120 ]




©2005 Association for Computing Machinery