824 search results - page 26 / 165 » Weighted Low-Rank Approximations |
93
Voted
CCCG
2007
15 years 3 months ago
2007
We introduce bundle-free triangulations, that are free of large collection of triangles overlapping a circle empty of vertices. We prove that bundle-free Steiner triangulations ca...
114
click to vote
JAT
2010
15 years 11 days ago
2010
We state some pointwise estimates for the rate of weighted approximation of a continuous function on the semiaxis by polynomials. Similarly to a previous result in C[−1, 1] due ...
199
click to vote
DC
2011
14 years 1 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
152
click to vote
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
144
click to vote
ECML
2006
Springer
15 years 5 months ago
2006
Springer
We present a new class of perceptron-like algorithms with margin in which the "effective" learning rate, defined as the ratio of the learning rate to the length of the we...