921 search results - page 14 / 185 » New Data Structures for Orthogonal Range Searching |
142
Voted
SIGMOD
2002
ACM
16 years 3 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
116
click to vote
WWW
2009
ACM
16 years 4 months ago
2009
ACM
More and more structured information in the form of semantic data is nowadays available. It offers a wide range of new possibilities especially for semantic search and Web data in...
135
Voted
CPM
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
180
Voted
SPIRE
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
130
Voted
STOC
2001
ACM
16 years 3 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...