112 search results - page 8 / 23 » Succinct Data Structures for Retrieval and Approximate Membe... |
116
click to vote
ICAPR
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
161
click to vote
VLDB
2002
ACM
15 years 10 months ago
2002
ACM
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...
BMCBI
2007
14 years 10 months ago
2007
nd: A key abstraction in representing proteomics knowledge is the notion of unique identifiers for individual entities (e.g. proteins) and the massive graph of relationships among...
84
Voted
SOFSEM
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. After text retrieval, the next waves in web searching and multimedia retrieval are the search for and delivery of images, music, video, and 3D scenes. Not only the percep...