369 search results - page 48 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
115
click to vote
AUTOMATICA
2008
14 years 12 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
123
click to vote
COMPGEOM
2008
ACM
15 years 1 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
NIPS
1994
15 years 1 months ago
1994
We present efficient algorithms for dealing with the problem of missing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation ...
101
click to vote
ICCAD
2001
IEEE
15 years 8 months ago
2001
IEEE
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...
PODC
2006
ACM
15 years 5 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...