3020 search results - page 167 / 604 » Similarity Queries on Structured Data in Structured Overlays |
186
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
159
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
183
click to vote
INTERNET
2010
15 years 5 months ago
2010
We propose a query formulation language, called MashQL for querying and mashing up structured data on the web. The novelty of MashQL is that it does not require...
141
click to vote
KDD
1997
ACM
15 years 10 months ago
1997
ACM
To formulate a meaningful query on semistructured data, such as on the Web, that matches some of the source’s structure, we need first to discover something about how the infor...
164
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper we propose two methods to derive two different kinds of node similarities in a network based on their neighborhood. The first similarity measure focuses on the overla...