Sciweavers

796 search results - page 72 / 160
» Approximating the centroid is hard
Sort
View
CORR
2006
Springer
140views Education» more  CORR 2006»
13 years 7 months ago
Nearly optimal exploration-exploitation decision thresholds
While in general trading off exploration and exploitation in reinforcement learning is hard, under some formulations relatively simple solutions exist. Optimal decision thresholds ...
Christos Dimitrakakis
MOBIHOC
2006
ACM
14 years 7 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 8 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 8 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala
INFOCOM
2010
IEEE
13 years 6 months ago
Routing for Energy Minimization in the Speed Scaling Model
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the ...
Matthew Andrews, Antonio Fernández, Lisa Zh...