1641 search results - page 106 / 329 » Termination Analysis with Algorithmic Learning |
120
Voted
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
147
Voted
ASPDAC
2006
ACM
15 years 9 months ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
119
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
Subspace methods such as PCA, LDA, ICA have become a standard tool to perform visual learning and recognition. In this paper we propose Representational Oriented Component Analysi...
133
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
Principal component analysis (PCA) minimizes the sum of squared errors (L2-norm) and is sensitive to the presence of outliers. We propose a rotational invariant L1-norm PCA (R1-PC...
139
Voted
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
One of the main problems in probabilistic grammatical inference consists in inferring a stochastic language, i.e. a probability distribution, in some class of probabilistic models...