824 search results - page 69 / 165 » Weighted Low-Rank Approximations |
133
click to vote
EUROCRYPT
1999
Springer
15 years 8 months ago
1999
Springer
A recoding rule for exponentiation is a method for reducing the cost of the exponentiation ae by reducing the number of required multiplications. If w(e) is the (hamming) weight of...
139
click to vote
ICCSA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...
124
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
129
click to vote
ESA
2005
Springer
15 years 9 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
145
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...