297 search results - page 3 / 60 » On the Fastest Vickrey Algorithm |
IWPEC
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...
ICIP
2009
IEEE
13 years 4 months ago
2009
IEEE
This article introduces a fast algorithm for Connected Component Labeling of binary images called Light Speed Labeling. It is segment-based and a line-relative labeling that was e...
ICASSP
2009
IEEE
13 years 4 months ago
2009
IEEE
The average consensus in wireless sensor networks is achieved under assumptions of symmetric or balanced topology at every time instant. However, communication and/or node failure...
ACIVS
2010
Springer
13 years 3 months ago
2010
Springer
Document image analysis is used to segment and classify regions of a document image into categories such as text, graphic and background. In this paper we first review existing doc...
SIAMCOMP
2008
13 years 6 months ago
2008
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...