921 search results - page 73 / 185 » New Data Structures for Orthogonal Range Searching |
142
click to vote
EDBT
2010
ACM
15 years 11 months ago
2010
ACM
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages or XML data schemas, the ambigui...
147
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
167
Voted
CIDR
2003
15 years 5 months ago
2003
With the rapid increase in the use of inexpensive, location-aware sensors in a variety of new applications, large amounts of time-sequenced location data will soon be accumulated....
161
click to vote
APIN
2000
15 years 4 months ago
2000
: A new dynamic tree structured network - the Stochastic Competitive Evolutionary Neural Tree (SCENT) is introduced. The network is able to provide a hierarchical classification of...
134
Voted
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clusteri...