2570 search results - page 108 / 514 » Fast Algorithms For The Computation Of Ranklets |
ECCV
2006
Springer
16 years 10 hour ago
2006
Springer
For many medical segmentation tasks, the contrast along most of the boundary of the target object is high, allowing simple thresholding or region growing approaches to provide near...
DAC
2009
ACM
15 years 1 months ago
2009
ACM
In this paper, we propose a novel simulation algorithm for large scale structured power grid networks. The new method formulates the traditional linear system as a special two-dim...
84
Voted
EOR
2008
14 years 10 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
ICCCN
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—Sequencer, privilege-based, and communication history algorithms are popular approaches to implement total ordering, where communication history algorithms are most suit...
COMGEO
1999
ACM
14 years 9 months ago
1999
ACM
The visual nature of geometry applications makes them a natural area where visualization can be an effective tool for demonstrating algorithms. In this paper we propose a new mode...