Sciweavers

3625 search results - page 704 / 725
» On choosing
Sort
View
PERCOM
2010
ACM
14 years 10 months ago
Privacy assurance in mobile sensing networks: Go beyond trusted servers
—Mobile devices are becoming the largest sensor network around the world. They could be used to collect a large amount of data with little effort and cost which is leading to a p...
Ling Hu, Cyrus Shahabi
PVLDB
2010
85views more  PVLDB 2010»
14 years 10 months ago
Xplus: A SQL-Tuning-Aware Query Optimizer
The need to improve a suboptimal execution plan picked by the query optimizer for a repeatedly run SQL query arises routinely. Complex expressions, skewed or correlated data, and ...
Herodotos Herodotou, Shivnath Babu
PVLDB
2010
175views more  PVLDB 2010»
14 years 10 months ago
Dynamic Join Optimization in Multi-Hop Wireless Sensor Networks
To enable smart environments and self-tuning data centers, we are developing the Aspen system for integrating physical sensor data, as well as stream data coming from machine logi...
Svilen R. Mihaylov, Marie Jacob, Zachary G. Ives, ...
QRE
2010
129views more  QRE 2010»
14 years 10 months ago
Improving quality of prediction in highly dynamic environments using approximate dynamic programming
In many applications, decision making under uncertainty often involves two steps- prediction of a certain quality parameter or indicator of the system under study and the subseque...
Rajesh Ganesan, Poornima Balakrishna, Lance Sherry
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
14 years 10 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