Sciweavers

239 search results - page 20 / 48
» Localized Upper and Lower Bounds for Some Estimation Problem...
Sort
View
CINQ
2004
Springer
131views Database» more  CINQ 2004»
15 years 3 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
IJCGA
2010
155views more  IJCGA 2010»
14 years 8 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Yoav Gabriely, Elon Rimon
ICC
2007
IEEE
153views Communications» more  ICC 2007»
15 years 4 months ago
A Walking Beacon-Assisted Localization in Wireless Sensor Networks
—The localization of the sensor node is a fundamental problem in sensor networks and can be implemented using powerful and expensive beacons. Beacons, the fewer the better, can a...
Bin Xiao, Hekang Chen, Shuigeng Zhou
EOR
2007
87views more  EOR 2007»
14 years 9 months ago
The TV-Break Packing Problem
Instead of selling advertisement spots one by one, some French satellite channels decided in 2002 to modify their commercial offer in order to sell packages of spots. These new g...
Thierry Benoist, Eric Bourreau, Benoît Rotte...
MST
2011
205views Hardware» more  MST 2011»
14 years 4 months ago
Sublinear Time Algorithms for Earth Mover's Distance
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt ...