3020 search results - page 46 / 604 » Optimal partition trees |
126
Voted
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
We propose a spectral partitioning approach for large-scale optimization problems, specifically structure from motion. In structure from motion, partitioning methods reduce the pr...
129
Voted
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We present an O(lg lg n)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lg n). This is the first major progress on Sleator...
158
click to vote
MIAR
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract. In this paper, we present a novel approach to matching cerebral vascular trees obtained from 3D-RA data-sets based on minimization of tree edit distance. Our approach is ...
150
Voted
ASPDAC
2012
ACM
13 years 11 months ago
2012
ACM
Behavioral synthesis tools have made significant progress in compiling high-level programs into register-transfer level (RTL) specifications. But manually rewriting code is still ...
156
Voted
ICPP
1998
IEEE
15 years 7 months ago
1998
IEEE
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...