316 search results - page 16 / 64 » On the Space Complexity of Randomized Synchronization |
AAAI
2008
14 years 3 days ago
2008
The search of a precise measure of what hardness of SAT instances means for state-of-the-art solvers is a relevant research question. Among others, the space complexity of treelik...
DCG
2008
13 years 9 months ago
2008
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract— In this paper, collocated and distributed spacetime block codes (DSTBCs) which admit multi-group maximum likelihood (ML) decoding are studied. First the collocated case...
AAAI
2004
13 years 11 months ago
2004
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
JSAC
2008
13 years 9 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...