2424 search results - page 330 / 485 » A general algorithm for data dependence analysis |
149
Voted
CORR
2010
Springer
15 years 3 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...
229
Voted
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
A burst is a large number of events occurring within a certain time window. As an unusual activity, it's a noteworthy phenomenon in many natural and social processes. Many da...
145
Voted
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Recent years have witnessed a dramatic increase in the quantity of image data collected, due to advances in fields such as medical imaging, reconnaissance, surveillance, astronomy...
150
Voted
KDD
2008
ACM
16 years 4 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
157
click to vote
KDD
2010
ACM
15 years 7 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...