Sciweavers

5329 search results - page 107 / 1066
» The Weighted Majority Algorithm
Sort
View
ICPR
2010
IEEE
14 years 2 months ago
Fingerprint Pore Matching Based on Sparse Representation
—This paper proposes an improved direct fingerprint pore matching method. It measures the differences between pores by using the sparse representation technique. The coarse pore ...
Feng Liu, Qijun Zhao, Lei Zhang, David Zhang
JMLR
2010
129views more  JMLR 2010»
13 years 4 months ago
Approximation of hidden Markov models by mixtures of experts with application to particle filtering
Selecting conveniently the proposal kernel and the adjustment multiplier weights of the auxiliary particle filter may increase significantly the accuracy and computational efficie...
Jimmy Olsson, Jonas Ströjby
ISAAC
2004
Springer
141views Algorithms» more  ISAAC 2004»
14 years 3 months ago
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
Jérôme Monnot, Vangelis Th. Paschos, ...
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
14 years 2 months ago
Extractors for Low-Weight Affine Sources
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
Anup Rao
ESA
2010
Springer
178views Algorithms» more  ESA 2010»
13 years 11 months ago
Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this ...
Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden