2192 search results - page 115 / 439 » Algorithms for Challenging Motif Problems |
139
click to vote
SSDBM
2010
IEEE
15 years 21 days 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...
128
click to vote
KDD
2012
ACM
13 years 5 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ï¬...
157
click to vote
ATAL
2009
Springer
15 years 9 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. ...
141
click to vote
CIKM
2006
Springer
15 years 6 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...
130
click to vote
STOC
2004
ACM
16 years 3 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...