Sciweavers

1389 search results - page 103 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
ICDM
2007
IEEE
106views Data Mining» more  ICDM 2007»
15 years 9 months ago
High-Speed Function Approximation
We address a new learning problem where the goal is to build a predictive model that minimizes prediction time (the time taken to make a prediction) subject to a constraint on mod...
Biswanath Panda, Mirek Riedewald, Johannes Gehrke,...
ICPR
2002
IEEE
16 years 4 months ago
A Robust Semi-Supervised EM-Based Clustering Algorithm with a Reject Option
In this paper, we address the problem of semisupervision in the framework of parametric clustering by using labeled and unlabeled data together. Clustering algorithms can take adv...
Christophe Saint-Jean, Carl Frélicot
NIPS
2000
15 years 4 months ago
Kernel Expansions with Unlabeled Examples
Modern classification applications necessitate supplementing the few available labeled examples with unlabeled examples to improve classification performance. We present a new tra...
Martin Szummer, Tommi Jaakkola
ICCAD
2001
IEEE
107views Hardware» more  ICCAD 2001»
16 years 1 days ago
A Convex Programming Approach to Positive Real Rational Approximation
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...
Carlos P. Coelho, Joel R. Phillips, Luis Miguel Si...
138
Voted
JAIR
2000
105views more  JAIR 2000»
15 years 2 months ago
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
Federico Barber