2638 search results - page 60 / 528 » Random Geometric Complexes |
125
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
130
click to vote
ICASSP
2009
IEEE
15 years 11 months ago
2009
IEEE
This paper is concerned with the problem of computing a discretecoefficient approximation to a digital filter. In contrast to earlier works that have approached this problem usi...
113
click to vote
FUN
2007
Springer
15 years 10 months ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
132
click to vote
ESA
1999
Springer
15 years 8 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
151
click to vote
ICIAR
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Due to improvements in image acquisition and storage technology, terabyte-sized databases of images are nowadays common. This abundance of data leads us to two basic prob...