Sciweavers

1214 search results - page 122 / 243
» Labeling Points with Weights
Sort
View
JCO
2010
182views more  JCO 2010»
14 years 11 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu
135
Voted
CVPR
2011
IEEE
14 years 8 months ago
Probabilistic Simultaneous Pose and Non-Rigid Shape Recovery
We present an algorithm to simultaneously recover nonrigid shape and camera poses from point correspondences between a reference shape and a sequence of input images. The key nove...
Francesc Moreno (Institut de Robotica i Informatic...
SIAMJO
2011
14 years 7 months ago
Minimizing the Condition Number of a Gram Matrix
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...
Xiaojun Chen, Robert S. Womersley, Jane J. Ye
119
Voted
ICN
2005
Springer
15 years 6 months ago
Scheduling Algorithms for Input Queued Switches Using Local Search Technique
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
Yanfeng Zheng, Simin He, Shutao Sun, Wen Gao
98
Voted
ICPR
2004
IEEE
16 years 1 months ago
Data Dependent Classifier Fusion for Construction of Stable Effective Algorithms
A measure of stability for a wide class of pattern recognition algorithms is introduced to cope with overfitting in classification problems. Based on this concept, constructive me...
Dmitry Kropotov, Dmitry Vetrov