Sciweavers

16404 search results - page 854 / 3281
» A set coverage problem
Sort
View
CVPR
2008
IEEE
16 years 9 months ago
Spectral methods for semi-supervised manifold learning
Given a finite number of data points sampled from a low-dimensional manifold embedded in a high dimensional space together with the parameter vectors for a subset of the data poin...
Zhenyue Zhang, Hongyuan Zha, Min Zhang
ICCV
2003
IEEE
16 years 9 months ago
Fast Pose Estimation with Parameter-Sensitive Hashing
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
Gregory Shakhnarovich, Paul A. Viola, Trevor Darre...
ICCV
2001
IEEE
16 years 9 months ago
Pairwise Face Recognition
We develop a pairwise classification framework for face recognition, in which a class face recognition problem is divided into a set of ? ?? ? two class problems. Such a problem...
Guodong Guo, HongJiang Zhang, Stan Z. Li
KDD
2008
ACM
135views Data Mining» more  KDD 2008»
16 years 8 months ago
Effective and efficient itemset pattern summarization: regression-based approaches
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
Ruoming Jin, Muad Abu-Ata, Yang Xiang, Ning Ruan
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
16 years 8 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson