2233 search results - page 127 / 447 » On the Complexity of Theory Curbing |
228
click to vote
TCAD
2010
15 years 1 months ago
2010
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
297
click to vote
COMPGEOM
2011
ACM
14 years 10 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...
294
click to vote
ICDT
2011
ACM
14 years 9 months ago
2011
ACM
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
215
click to vote
IACR
2011
14 years 6 months ago
2011
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
198
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...