13621 search results - page 118 / 2725 » Computability and Complexity in Self-assembly |
CORR
2011
Springer
13 years 1 months ago
2011
Springer
—Building upon recent approaches for detection of impulse-radio ultra-wideband (IR-UWB) based on compressed sensing (CS), we combine this approach with techniques known from adva...
SIGGRAPH
1997
ACM
14 years 2 months ago
1997
ACM
Simulating realistic lighting and rendering complex scenes are usually considered separate problems with incompatible solutions. Accurate lighting calculations are typically perfo...
LICS
1999
IEEE
14 years 2 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
CIE
2008
Springer
14 years 6 days ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
FSTTCS
2009
Springer
14 years 4 months ago
2009
Springer
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...