Sciweavers

10457 search results - page 349 / 2092
» Data Mapping as Search
Sort
View
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
15 years 11 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
DEBU
2010
135views more  DEBU 2010»
15 years 6 months ago
Enhancing Search with Structure
Keyword search has traditionally focussed on retrieving documents in ranked order, given simple keyword queries. Similarly, work on keyword queries on structured data has focussed...
Soumen Chakrabarti, Sunita Sarawagi, S. Sudarshan
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 9 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
WCNC
2008
IEEE
16 years 1 months ago
Integrated Source-Channel Decoding for Correlated Data-Gathering Sensor Networks
Abstract— This paper explores integrated source-channel decoding, driven by wireless sensor network applications where correlated information acquired by the network is gathered ...
Sheryl L. Howard, Paul G. Flikkema
OTM
2005
Springer
16 years 7 days ago
Don't Mind Your Vocabulary: Data Sharing Across Heterogeneous Peers
The strong dynamics of peer-to-peer networks, coupled with the diversity of peer vocabularies, makes query processing in peer database systems a very challenging task. In this pape...
Mehedi Masud, Iluju Kiringa, Anastasios Kementsiet...