2192 search results - page 115 / 439 » Algorithms for Challenging Motif Problems |
SSDBM
2010
IEEE
13 years 6 months ago
2010
IEEE
Reservoir sampling is a well-known technique for random sampling over data streams. In many streaming applications, however, an input stream may be naturally heterogeneous, i.e., c...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
The prevalent use of social media produces mountains of unlabeled, high-dimensional data. Feature selection has been shown effective in dealing with high-dimensional data for eï¬...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...
CIKM
2006
Springer
13 years 12 months ago
2006
Springer
Data stream clustering has emerged as a challenging and interesting problem over the past few years. Due to the evolving nature, and one-pass restriction imposed by the data strea...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...