Sciweavers

654 search results - page 120 / 131
» On the Approximation of Computing Evolutionary Trees
Sort
View
VLDB
2007
ACM
181views Database» more  VLDB 2007»
15 years 10 months ago
STAR: Self-Tuning Aggregation for Scalable Monitoring
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
Navendu Jain, Michael Dahlin, Yin Zhang, Dmitry Ki...
ADHOCNOW
2008
Springer
15 years 4 months ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...
95
Voted
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
15 years 2 months ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
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...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
ICRA
1999
IEEE
126views Robotics» more  ICRA 1999»
15 years 1 months ago
Monte Carlo Localization for Mobile Robots
Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilisticlocalization algorithms known as Monte...
Frank Dellaert, Dieter Fox, Wolfram Burgard, Sebas...
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
15 years 1 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov