Sciweavers

1653 search results - page 287 / 331
» Computer science and game theory
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
ICFP
2006
ACM
14 years 8 months ago
Static typing for a faulty lambda calculus
A transient hardware fault occurs when an energetic particle strikes a transistor, causing it to change state. These faults do not cause permanent damage, but may result in incorr...
David Walker, Lester W. Mackey, Jay Ligatti, Georg...
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
EUSFLAT
2009
146views Fuzzy Logic» more  EUSFLAT 2009»
13 years 6 months ago
Opposite Fuzzy Sets with Applications in Image Processing
Diverse forms of the concept of opposition are already existent in philosophy, linguistics, psychology and physics. The interplay between entities and opposite entities is apparent...
Hamid R. Tizhoosh
FOCS
2009
IEEE
14 years 3 months ago
A Parallel Repetition Theorem for Any Interactive Argument
— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an ex...
Iftach Haitner