824 search results - page 91 / 165 » Weighted Low-Rank Approximations |
110
click to vote
COMPGEOM
2008
ACM
14 years 11 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 ...
TNN
1998
14 years 9 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
JAIR
2010
14 years 8 months ago
2010
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
—Existing packet schedulers that provide fair sharing of an output link can be divided into two classes: sorted priority and frame-based. Sorted priority methods provide excellen...