Sciweavers

3897 search results - page 331 / 780
» complexity 2010
Sort
View
192
Voted
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
15 years 11 months ago
Weighted Geometric Set Cover via Quasi-Uniform Sampling
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
Kasturi Varadarajan
179
Voted
SAC
2010
ACM
15 years 11 months ago
Data stream anomaly detection through principal subspace tracking
We consider the problem of anomaly detection in multiple co-evolving data streams. In this paper, we introduce FRAHST (Fast Rank-Adaptive row-Householder Subspace Tracking). It au...
Pedro Henriques dos Santos Teixeira, Ruy Luiz Mili...
171
Voted
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 11 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
AI
2010
Springer
15 years 11 months ago
Overlap versus Imbalance
Abstract. In this paper we give a systematic analysis of the relationship between imbalance and overlap as factors influencing classifier performance. We demonstrate that these t...
Misha Denil, Thomas P. Trappenberg
CIE
2010
Springer
15 years 11 months ago
Approximate Self-assembly of the Sierpinski Triangle
The Tile Assembly Model is a Turing universal model that Winfree introduced in order to study the nanoscale self-assembly of complex (typically aperiodic) DNA crystals. Winfree ex...
Jack H. Lutz, Brad Shutters