11345 search results - page 1757 / 2269 » Foundations of Computer Science |
194
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
143
Voted
SENSYS
2005
ACM
15 years 10 months ago
2005
ACM
ng Link Abstraction for Wireless Sensor Networks Joseph Polastre, Jonathan Hui, Philip Levis, Jerry Zhao, David Culler, Scott Shenker, and Ion Stoica Computer Science Department In...
119
click to vote
DGCI
2005
Springer
15 years 10 months ago
2005
Springer
Naive discrete planes are well known to be functional on a coordinate plane. The aim of our paper is to extend the functionality concept to a larger family of arithmetic discrete ...
140
Voted
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
171
Voted
ACMSE
2004
ACM
15 years 10 months ago
2004
ACM
Modern processors include features such as deep pipelining, multilevel cache hierarchy, branch predictors, out of order execution engine, and advanced floating point and multimedi...