3020 search results - page 449 / 604 » Similarity Queries on Structured Data in Structured Overlays |
203
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
197
Voted
CIKM
2005
Springer
16 years 16 days ago
2005
Springer
Holistic twig join algorithms represent the state of the art for evaluating path expressions in XML queries. Using inverted indexes on XML elements, holistic twig joins move a set...
232
click to vote
ICDM
2006
IEEE
16 years 1 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
175
click to vote
AMW
2010
15 years 8 months ago
2010
Abstract. A large volume of data with complex structures is currently represented in GML (Geography Markup Language) for storing and exchanging geographic information. As the size ...
242
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: Cluster analysis is an important technique for the exploratory analysis of biological data. Such data is often high-dimensional, inherently noisy and contains outliers...