3049 search results - page 159 / 610 » On the Convergence of Bound Optimization Algorithms |
170
click to vote
IJCGA
2006
15 years 6 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
174
click to vote
ICIAP
2007
ACM
16 years 6 months ago
2007
ACM
This paper proposes a novel technique for performing fast block matching for motion estimation which is optimal, meaning it yields the same results as a full-search investigation....
156
click to vote
ASAP
2006
IEEE
16 years 14 days ago
2006
IEEE
In this paper, we analyze the theoretical delay bound of the SHA-1 algorithm and propose architectures to achieve high throughput hardware implementations which approach this boun...
154
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Distributed constraint optimization problems (DCOPs) are a popular way of formulating and solving agent-coordination problems. It is often desirable to solve DCOPs optimally with m...
211
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...