3946 search results - page 38 / 790 » The computational complexity of choice sets |
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— This paper explores relay selection and selection diversity for coded cooperation in wireless sensor networks, with complexity constraints for the sensor nodes. In previous wor...
APAL
2006
14 years 12 months ago
2006
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
SOFSEM
2007
Springer
15 years 5 months ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
115
click to vote
MIAR
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract. A main focus of statistical shape analysis is the description of variability of a population of geometric objects. In this paper, we present work in progress towards mode...
CG
2004
Springer
14 years 11 months ago
2004
Springer
Splatting-based rendering techniques are currently the best choice for efficient high-quality rendering of point-based geometries. However, such techniques are not suitable for la...