628 search results - page 100 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
133
click to vote
STOC
1996
ACM
15 years 6 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
122
click to vote
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
124
Voted
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
— Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [1] are the dominant architectures...
120
click to vote
DIALM
2004
ACM
15 years 8 months ago
2004
ACM
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
146
click to vote
PKDD
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...