356 search results - page 50 / 72 » Approximation schemes for the Min-Max Starting Time Problem |
242
click to vote
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
127
click to vote
SP
2008
IEEE
15 years 10 months ago
2008
IEEE
We consider the following problem: how can two devices that do not share any secrets establish a shared secret key over a wireless radio channel in the presence of a communication...
212
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
150
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
172
click to vote
MOBICOM
2006
ACM
15 years 10 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...