10988 search results - page 1686 / 2198 » Algorithmic Folding Complexity |
202
click to vote
EDBT
2006
ACM
16 years 7 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
185
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
197
click to vote
LCTRTS
2010
Springer
16 years 2 months ago
2010
Springer
Coarse Grain Reconfigurable Architectures (CGRAs) promise high performance at high power efficiency. They fulfil this promise by keeping the hardware extremely simple, and movi...
227
click to vote
ISBI
2009
IEEE
16 years 2 months ago
2009
IEEE
Dynamic cardiac metrics, including myocardial strains and displacements, provide a quantitative approach to evaluate cardiac function. However, in current clinical diagnosis, larg...
256
click to vote
MOBIHOC
2009
ACM
16 years 2 months ago
2009
ACM
Spectrum is a critical yet scarce resource and it has been shown that dynamic spectrum access can significantly improve spectrum utilization. To achieve this, it is important to ...