Sciweavers

2699 search results - page 328 / 540
» Planning to Gather Information
Sort
View
SODA
1996
ACM
101views Algorithms» more  SODA 1996»
15 years 7 months ago
Randomized Robot Navigation Algorithms
We consider the problem faced by a mobile robot that has to reach a given target by traveling through an unmapped region in the plane containing oriented rectangular obstacles. We...
Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Kar...
MOBIDE
2010
ACM
15 years 6 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...
SIGCOMM
2010
ACM
15 years 6 months ago
How green is IP-telephony?
With constantly increasing costs of energy, we ask ourselves what we can say about the energy efficiency of existing VoIP systems. To answer that question, we gather information a...
Salman Abdul Baset, Joshua Reich, Jan Janak, Pavel...
SIGMOD
2010
ACM
165views Database» more  SIGMOD 2010»
15 years 6 months ago
Creating and exploring web form repositories
We present DeepPeep (http://www.deeppeep.org), a new system for discovering, organizing and analyzing Web forms. DeepPeep allows users to explore the entry points to hidden-Web si...
Luciano Barbosa, Hoa Nguyen, Thanh Hoang Nguyen, R...
ICASSP
2010
IEEE
15 years 6 months ago
Optimize the obvious: Automatic call flow generation
In commercial spoken dialog systems, call flows are built by call flow designers implementing a predefined business logic. While it may appear obvious from this logic how the c...
David Suendermann, Jackson Liscombe, Roberto Piera...