Sciweavers

2735 search results - page 73 / 547
» Comparing notions of randomness
Sort
View
CVPR
2010
IEEE
14 years 1 months ago
A Novel Markov Random Field Based Deformable Model for Face Recognition
In this paper, a new scheme to address the face recognition problem is proposed. Different from traditional face recognition approaches which represent each facial image by a sing...
Shu Liao, Albert C.S. Chung
COLT
1999
Springer
14 years 1 months ago
Beating the Hold-Out: Bounds for K-fold and Progressive Cross-Validation
The empirical error on a test set, the hold-out estimate, often is a more reliable estimate of generalization error than the observed error on the training set, the training estim...
Avrim Blum, Adam Kalai, John Langford
DCOSS
2006
Springer
14 years 17 days ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
AI
2010
Springer
13 years 9 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
JSAT
2008
122views more  JSAT 2008»
13 years 8 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya