570 search results - page 62 / 114 » Reconfigurable Architectures: A New Vision for Optimization ... |
150
click to vote
DAC
1989
ACM
15 years 10 months ago
1989
ACM
We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...
173
click to vote
EMMCVPR
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
201
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...
169
Voted
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we tackle the problem of object detection and tracking in a new and challenging domain of wide area surveillance. This problem poses several challenges: large camera...
180
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
This paper proposes a simple “prior-free” method for solving non-rigid structure-from-motion factorization problems. Other than using the basic low-rank condition, our method ...