477 search results - page 75 / 96 » Complexity Considerations, cSAT Problem Lower Bound |
DAC
1997
ACM
13 years 11 months ago
1997
ACM
We present a system-level approach for power optimization under a set of user specified costs and timing constraints of hard real-time designs. The approach optimizes all three d...
AIEDAM
2008
13 years 7 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
COMPGEOM
2007
ACM
13 years 9 months ago
2007
ACM
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...