2570 search results - page 316 / 514 » Fast Algorithms For The Computation Of Ranklets |
160
click to vote
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
In this paper, we present a new method for segmenting closed contours and surfaces. Our work builds on a variant of the Fast Marching algorithm. First, an initial point on the des...
132
click to vote
ICCV
2001
IEEE
16 years 5 months ago
2001
IEEE
Tree-structured probabilistic models admit simple, fast inference. However, they are not well suited to phenomena such as occlusion, where multiple components of an object may dis...
119
Voted
ASPLOS
1991
ACM
15 years 7 months ago
1991
ACM
Access/execute architectures have several advantages over more traditional architectures. Because address generation and memory access are decoupled from operand use, memory laten...
121
Voted
ISMB
1998
15 years 5 months ago
1998
The avMlability of large EST(Expressed Sequence Tag)databases has led to a revolution in the waynew genes are cloned. Difficulties arise, however,due to high error rates and redun...
118
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...