921 search results - page 122 / 185 » New Data Structures for Orthogonal Range Searching |
280
click to vote
ICDE
1996
IEEE
16 years 5 months ago
1996
IEEE
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
135
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
We propose a new top down search-based algorithm for compiling AND/OR Multi-Valued Decision Diagrams (AOMDDs), as representations of the optimal set of solutions for constraint opt...
124
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
122
click to vote
SPIRE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
164
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
In a wide range of business areas dealing with text data streams, including CRM, knowledge management, and Web monitoring services, it is an important issue to discover topic tren...