4972 search results - page 664 / 995 » Ranking on graph data |
193
click to vote
SIGMOD
1996
ACM
15 years 10 months ago
1996
ACM
While much recent research has focussed on extending databases beyond the traditional relational model, relatively little has been done to develop database tools for querying data...
174
click to vote
IOPADS
1996
15 years 8 months ago
1996
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
178
click to vote
PVLDB
2008
15 years 6 months ago
2008
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
213
Voted
KDD
2010
ACM
15 years 10 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
203
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...