2570 search results - page 75 / 514 » Fast Algorithms For The Computation Of Ranklets |
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper, our contributions are two-fold: First, we enhance the Min-Min and Sufferage heuristics under three risk modes driven by security concerns. Second, we propose a new ...
141
click to vote
CASC
2011
Springer
13 years 10 months ago
2011
Springer
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
SODA
1997
ACM
14 years 11 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
ICIAR
2010
Springer
14 years 7 months ago
2010
Springer
Image segmentation is a critical low-level visual routine for robot perception. However, most image segmentation approaches are still too slow to allow real-time robot operation. I...
179
click to vote
ICDAR
2011
IEEE
13 years 9 months ago
2011
IEEE
—In this paper, we present a novel approach for super-resolved binarization of document images acquired by low quality devices. The algorithm tries to compute the super resolutio...