4886 search results - page 300 / 978 » Approximate Data Exchange |
181
click to vote
WIOPT
2006
IEEE
16 years 16 days ago
2006
IEEE
We consider the problem of optimizing the number of replicas for event information in wireless sensor networks, when queries are disseminated using expanding rings. We obtain clos...
163
click to vote
DMSN
2004
ACM
15 years 12 months ago
2004
ACM
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
154
click to vote
ICANN
2003
Springer
15 years 11 months ago
2003
Springer
We discuss a Probably Approximate Correct (PAC) learning paradigm for Boolean formulas, which we call PAC meditation, where the class of formulas to be learnt is not known in advan...
179
click to vote
ICANN
2009
Springer
15 years 10 months ago
2009
Springer
In a typical reinforcement learning (RL) setting details of the environment are not given explicitly but have to be estimated from observations. Most RL approaches only optimize th...
167
click to vote
CCCG
2008
15 years 8 months ago
2008
We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the applica...