Sciweavers

4 search results - page 1 / 1
» Three distance theorem and grid graph
Sort
View
DM
2000
91views more  DM 2000»
13 years 4 months ago
Three distance theorem and grid graph
We will prove a d-dimensional version of the Geelen and Simpson theorem. c 2000 Elsevier Science B.V. All rights reserved.
Nicolas Chevallier
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
13 years 11 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...
TCSV
2010
12 years 11 months ago
Face and Human Gait Recognition Using Image-to-Class Distance
We propose a new distance measure for face recognition and human gait recognition. Each probe image (a face image or an average human silhouette image) is represented as a set of ...
Yi Huang, Dong Xu, Tat-Jen Cham
ACISICIS
2007
IEEE
13 years 11 months ago
Minimum Message Length Clustering of Spatially-Correlated Data with Varying Inter-Class Penalties
We present here some applications of the Minimum Message Length (MML) principle to spatially correlated data. Discrete valued Markov Random Fields are used to model spatial correl...
Gerhard Visser, David L. Dowe