Sciweavers

109 search results - page 12 / 22
» Large independent sets in regular graphs of large girth
Sort
View
ICML
2005
IEEE
15 years 10 months ago
Harmonic mixtures: combining mixture models and graph-based methods for inductive and scalable semi-supervised learning
Graph-based methods for semi-supervised learning have recently been shown to be promising for combining labeled and unlabeled data in classification problems. However, inference f...
Xiaojin Zhu, John D. Lafferty
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
14 years 11 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
SIGMOD
1997
ACM
131views Database» more  SIGMOD 1997»
15 years 1 months ago
Maintenance of Data Cubes and Summary Tables in a Warehouse
Data warehouses contain large amounts of information, often collected from a variety of independent sources. Decision-support functions in a warehouse, such as on-line analytical ...
Inderpal Singh Mumick, Dallan Quass, Barinderpal S...
90
Voted
IPPS
2006
IEEE
15 years 3 months ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...
PAMI
1998
134views more  PAMI 1998»
14 years 9 months ago
A Bayesian Framework for Deformable Pattern Recognition With Application to Handwritten Character Recognition
—Deformable models have recently been proposed for many pattern recognition applications due to their ability to handle large shape variations.These proposed approaches represent...
Kwok-Wai Cheung, Dit-Yan Yeung, Roland T. Chin