25 search results - page 2 / 5 » Can Approximation Circumvent Gibbard-Satterthwaite |
SIGECOM
2009
ACM
13 years 11 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
We pose the problem of tracing traitors, who have colluded to circumvent a multimedia fingerprinting system, as a sparse underdetermined linear problem. We propose a range of det...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
ICCD
2008
IEEE
13 years 11 months ago
2008
IEEE
We present a new micro-architecture for evaluating functions based on piecewise quadratic interpolation. The micro-architecture consists mainly of a look-up table and two multiply...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
A weighted sum-rate maximization problem is considered for an access point (AP) allocating resources to wireless cognitive radios (CRs) communicating using orthogonal frequency-di...