5329 search results - page 345 / 1066 » The Weighted Majority Algorithm |
167
Voted
TSP
2010
15 years 1 months ago
2010
In this paper, we consider mixture approaches that adaptively combine outputs of several parallel running adaptive algorithms. These parallel units can be considered as diversity b...
240
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
147
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We present a shape matching algorithm based on the chamfer distance transform which can be easily integrated into the well-known SIFT framework. The shape matching was designed to...
170
click to vote
3DPVT
2004
IEEE
15 years 10 months ago
2004
IEEE
We present a formulation of boundary mesh segmentation as an optimization problem. Previous segmentation solutions are classified according to the different segmentation goals, th...
139
click to vote
IADIS
2003
15 years 8 months ago
2003
The key features of the principal interior routing protocols for large systems are considered and compared, and the major weaknesses of the open standards noted. A proposal is giv...