Sciweavers

3341 search results - page 222 / 669
» On Bounded Queries and Approximation
Sort
View
FOCS
2010
IEEE
15 years 4 months ago
Black-Box Randomized Reductions in Algorithmic Mechanism Design
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...
Shaddin Dughmi, Tim Roughgarden
TCAD
2010
107views more  TCAD 2010»
15 years 1 months ago
Evaluating Statistical Power Optimization
In response to the increasing variations in integrated-circuit manufacturing, the current trend is to create designs that take these variations into account statistically. In this ...
Jason Cong, Puneet Gupta, John Lee
PODS
1995
ACM
124views Database» more  PODS 1995»
15 years 10 months ago
Window Query-Optimal Clustering of Spatial Objects
During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result,...
Bernd-Uwe Pagel, Hans-Werner Six, Mario Winter
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
16 years 8 months ago
Efficient Top-k Query Evaluation on Probabilistic Data
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
Christopher Re, Nilesh N. Dalvi, Dan Suciu
ICDE
2006
IEEE
163views Database» more  ICDE 2006»
16 years 8 months ago
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
Adam Silberstein, Carla Schlatter Ellis, Jun Yang ...