824 search results - page 18 / 165 » Weighted Low-Rank Approximations |
COCO
2010
Springer
14 years 11 days ago
2010
Springer
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
ICPR
2002
IEEE
14 years 9 months ago
2002
IEEE
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
APPROX
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...