3341 search results - page 607 / 669 » On Bounded Queries and Approximation |
139
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
168
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
158
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
206
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
257
click to vote
MSWIM
2009
ACM
16 years 10 days ago
2009
ACM
It is common practice in wireless multihop network evaluations to ignore interfering signals below a certain signal strength threshold. This paper investigates the thesis that thi...