Sciweavers

61 search results - page 5 / 13
» Choosing Your Beliefs
Sort
View
GLOBECOM
2009
IEEE
14 years 2 months ago
The Directional Attack on Wireless Localization -or- How to Spoof Your Location with a Tin Can
—802.11 localization algorithms provide the ability to accurately position and track wireless clients thereby enabling location-based services and applications. However, we show ...
Kevin S. Bauer, Damon McCoy, Eric W. Anderson, Mar...
PVLDB
2008
84views more  PVLDB 2008»
13 years 7 months ago
When is it time to rethink the aggregate configuration of your OLAP server?
OLAP servers based on relational backends typically exploit materialized aggregate tables to improve response times of complex analytical queries. One of the key problems in this ...
Katja Hose, Daniel Klan, Matthias Marx, Kai-Uwe Sa...
UAI
2001
13 years 9 months ago
Vector-space Analysis of Belief-state Approximation for POMDPs
We propose a new approach to value-directed belief state approximationfor POMDPs. The valuedirected model allows one to choose approximation methods for belief state monitoringtha...
Pascal Poupart, Craig Boutilier
WAW
2004
Springer
150views Algorithms» more  WAW 2004»
14 years 1 months ago
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 6 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg