Sciweavers

1819 search results - page 110 / 364
» Computability and Representations of the Zero Set
Sort
View
ICPR
2004
IEEE
15 years 11 months ago
A Pattern Synthesis Technique with an Efficient Nearest Neighbor Classifier for Binary Pattern Recognition
Important factors affecting the efficiency and performance of the nearest neighbor classifier (NNC) are space, classification time requirements and for high dimensional data, due ...
M. Narasimha Murty, P. Viswanath, Shalabh Bhatnaga...
CORR
2007
Springer
88views Education» more  CORR 2007»
14 years 10 months ago
Decisive Markov Chains
We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almos...
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Ma...
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
14 years 11 months ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
COMGEO
2011
ACM
14 years 5 months ago
Stabbers of line segments in the plane
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the follo...
Mercè Claverol, Delia Garijo, Clara I. Grim...
ICIP
2008
IEEE
15 years 11 months ago
Kernel-based high-dimensional histogram estimation for visual tracking
We propose an approach for non-rigid tracking that represents objects by their set of distribution parameters. Compared to joint histogram representations, a set of parameters suc...
Allen Tannenbaum, James G. Malcolm, Peter Karasev