Sciweavers

461 search results - page 38 / 93
» Bounds for Validation
Sort
View
IPCO
1996
121views Optimization» more  IPCO 1996»
14 years 8 days ago
Transitive Packing
This paper attempts to provide a better understanding of the facial structure of polyhedra previously investigated separately. It introduces the notion of transitive packing and th...
Rudolf Müller, Andreas S. Schulz
TIP
2008
154views more  TIP 2008»
13 years 11 months ago
Adaptive Local Linear Regression With Application to Printer Color Management
Abstract--Local learning methods, such as local linear regression and nearest neighbor classifiers, base estimates on nearby training samples, neighbors. Usually, the number of nei...
Maya R. Gupta, Eric K. Garcia, E. Chin
MOR
2002
102views more  MOR 2002»
13 years 10 months ago
Facets of the Complementarity Knapsack Polytope
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
Ismael R. de Farias Jr., Ellis L. Johnson, George ...
PAMI
2002
136views more  PAMI 2002»
13 years 10 months ago
On the Individuality of Fingerprints
Fingerprint identification is based on two basic premises: (i) persistence: the basic characteristics of fingerprints do not change with time; and (ii) individuality: the fingerpr...
Sharath Pankanti, Salil Prabhakar, Anil K. Jain
ESOP
2011
Springer
13 years 2 months ago
A New Method for Dependent Parsing
Abstract. Dependent grammars extend context-free grammars by allowing semantic values to be bound to variables and used to constrain parsing. Dependent grammars can cleanly specify...
Trevor Jim, Yitzhak Mandelbaum