Sciweavers

4171 search results - page 409 / 835
» Choice numbers of graphs
Sort
View
JGT
2010
152views more  JGT 2010»
15 years 1 months ago
Cycles of even lengths modulo k
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...
Ajit A. Diwan
CVPR
2005
IEEE
16 years 9 months ago
Tracking Multiple Mouse Contours (without Too Many Samples)
We present a particle filtering algorithm for robustly tracking the contours of multiple deformable objects through severe occlusions. Our algorithm combines a multiple blob track...
Kristin Branson, Serge Belongie
ICPR
2008
IEEE
16 years 8 months ago
Active query selection for semi-supervised clustering
Semi-supervised clustering allows a user to specify available prior knowledge about the data to improve the clustering performance. A common way to express this information is in ...
Anil K. Jain, Pavan Kumar Mallapragada, Rong Jin
ICML
2007
IEEE
16 years 7 months ago
Dimensionality reduction and generalization
In this paper we investigate the regularization property of Kernel Principal Component Analysis (KPCA), by studying its application as a preprocessing step to supervised learning ...
Sofia Mosci, Lorenzo Rosasco, Alessandro Verri
ICML
2005
IEEE
16 years 7 months ago
Unsupervised evidence integration
Many biological propositions can be supported by a variety of different types of evidence. It is often useful to collect together large numbers of such propositions, together with...
Philip M. Long, Vinay Varadan, Sarah Gilman, Mark ...