3020 search results - page 90 / 604 » Similarity Queries on Structured Data in Structured Overlays |
264
click to vote
ICDE
2004
IEEE
16 years 7 months ago
2004
IEEE
XML and other types of semi-structured data are typically represented by a labeled directed graph. To speed up path expression queries over the graph, a variety of structural inde...
178
click to vote
WADS
1997
Springer
15 years 10 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
165
click to vote
CCCG
2010
15 years 7 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
148
click to vote
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents a fast mesh simplification algorithm that combined the half-edge data structure with modified quadric error metric (QEM). When half-edge structure is used, the...
149
click to vote
DBISP2P
2004
Springer
15 years 11 months ago
2004
Springer
Peer-to-peer systems offer an efficient means for sharing data among autonomous nodes. A central issue is locating the nodes with data matching a user query. A decentralized solut...