242 search results - page 22 / 49 » Object-level Vertical Search |
121
Voted
SIAMCOMP
1998
15 years 2 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
141
Voted
BMCBI
2010
15 years 2 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
128
Voted
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
150
Voted
COCOON
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
121
Voted
WWW
2007
ACM
16 years 3 months ago
2007
ACM
The primary function of current Web search engines is essentially relevance ranking at the document level. However, myriad structured information about real-world objects is embed...