10051 search results - page 1593 / 2011 » A Dynamic Separator Algorithm |
129
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Given multiple time sequences with missing values, we propose DynaMMo which summarizes, compresses, and finds latent variables. The idea is to discover hidden variables and learn ...
126
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
117
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
267
click to vote
VLDB
2007
ACM
16 years 5 months ago
2007
ACM
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for proc...
137
click to vote
MOBIHOC
2006
ACM
16 years 4 months ago
2006
ACM
Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces stora...