217 search results - page 21 / 44 » Backdoors To Typical Case Complexity |
SIAMCOMP
2010
14 years 5 months ago
2010
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
123
click to vote
TCAD
2010
14 years 5 months ago
2010
Design debugging is a major bottleneck in modern VLSI design flows as both the design size and the length of the error trace contribute to its inherent complexity. With typical des...
MICRO
2006
IEEE
14 years 11 months ago
2006
IEEE
Predication facilitates high-bandwidth fetch and large static scheduling regions, but has typically been too complex to implement comprehensively in out-of-order microarchitecture...
162
click to vote
GIS
2009
ACM
16 years 6 days ago
2009
ACM
A common problem in moving object databases (MOD) is the reconstruction of a trajectory from a trajectory sample (i.e., a finite sequence of time-space points). A typical solution...
ICC
2007
IEEE
15 years 5 months ago
2007
IEEE
Abstract— Optical Burst and Packet Switching are being considered as the most promising paradigms to increase bandwidth efficiency in IP over DWDM networks. In both cases, due t...