Sciweavers

3708 search results - page 558 / 742
» The Inverse Classification Problem
Sort
View
SIAMJO
2000
74views more  SIAMJO 2000»
15 years 6 months ago
A Specialized Interior-Point Algorithm for Multicommodity Network Flows
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
Jordi Castro
JMMA
2002
90views more  JMMA 2002»
15 years 6 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...
180
Voted
ML
2002
ACM
127views Machine Learning» more  ML 2002»
15 years 6 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...
119
Voted
SIAMAM
2002
72views more  SIAMAM 2002»
15 years 6 months ago
Desorption Overshoot in Polymer-Penetrant Systems: Asymptotic and Computational Results
Many practically relevant polymers undergoing desorption change from the rubbery (saturated) to the glassy (nearly dry) state. The dynamics of such systems cannot be described by t...
David A. Edwards, Richard A. Cairncross
ACMSE
2010
ACM
15 years 4 months ago
Mining relaxed closed subspace clusters
This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culli...
Erich Allen Peterson, Peiyi Tang