Sciweavers

410 search results - page 24 / 82
» Max and min limiters
Sort
View
IJCV
2008
241views more  IJCV 2008»
13 years 7 months ago
Object Class Recognition and Localization Using Sparse Features with Limited Receptive Fields
We investigate the role of sparsity and localized features in a biologically-inspired model of visual object classification. As in the model of Serre, Wolf, and Poggio, we first a...
Jim Mutch, David G. Lowe
DAGM
2008
Springer
13 years 9 months ago
Simple Incremental One-Class Support Vector Classification
We introduce the OneClassMaxMinOver (OMMO) algorithm for the problem of one-class support vector classification. The algorithm is extremely simple and therefore a convenient choice...
Kai Labusch, Fabian Timm, Thomas Martinetz
DISOPT
2006
101views more  DISOPT 2006»
13 years 7 months ago
Greedy-type resistance of combinatorial problems
This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...
Gareth Bendall, François Margot
PAMI
2002
164views more  PAMI 2002»
13 years 7 months ago
Efficient Dilation, Erosion, Opening, and Closing Algorithms
We propose an efficient and deterministic algorithm for computing the one-dimensional dilation and erosion (max and min) sliding window filters. For a p-element sliding window, our...
Joseph Gil, Ron Kimmel
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
13 years 11 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar