1244 search results - page 58 / 249 » Searching in Higher Dimension |
ADC
2004
Springer
15 years 7 months ago
2004
Springer
Concerted research effort since the nineteen fifties has lead to effective methods for retrieval of relevant documents from homogeneous collections of text, such as r archives,...
213
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
With the explosion in the amount of semi-structured data users access and store, there is a need for complex search tools to retrieve often very heterogeneous data in a simple and ...
CHI
2003
ACM
16 years 2 months ago
2003
ACM
There are currently two dominant interface types for searching and browsing large image collections: keywordbased search, and searching by overall similarity to sample images. We ...
128
click to vote
CORR
2004
Springer
15 years 1 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...
123
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...