478 search results - page 30 / 96 » Improving probability bounds by optimization over subsets |
MOBIHOC
2001
ACM
14 years 7 months ago
2001
ACM
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
This paper addresses the problem of active model selection for nonlinear dynamical systems. We propose a novel learning approach that selects the most informative subset of time-d...
ICIP
2000
IEEE
14 years 9 months ago
2000
IEEE
In a variety of applications (including automatic target recognition) image classification algorithms operate on compressed image data. This paper explores the design of optimal t...
SIROCCO
1998
13 years 9 months ago
1998
We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in 3 , for partial broadcasting and orientation...
MST
2011
13 years 2 months ago
2011
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...