10457 search results - page 1601 / 2092 » Data Mapping as Search |
176
click to vote
CIKM
2007
Springer
16 years 1 months ago
2007
Springer
Queries issued by casual users or specialists exploring a data set often point us to important subsets of the data, be it clusters, outliers or other features of particular import...
202
click to vote
MM
2004
ACM
16 years 11 days ago
2004
ACM
With the increasing ubiquity of sensors and computational resources, it is becoming easier and increasingly common for people to electronically record, photographs, text, audio, a...
242
click to vote
ECCV
2010
Springer
16 years 5 days ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
198
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
207
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...