2766 search results - page 352 / 554 » Algorithms for trigonometric polynomials |
159
Voted
KDD
2006
ACM
16 years 5 months ago
2006
ACM
We study the problem of private classification using kernel methods. More specifically, we propose private protocols implementing the Kernel Adatron and Kernel Perceptron learning ...
116
click to vote
DCC
2004
IEEE
16 years 4 months ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
107
click to vote
ALT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We describe an alternative construction of an existing canonical representation for definite Horn theories, the Guigues-Duquenne basis (or GD basis), which minimizes a n...
128
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the c...
117
click to vote
BIRTHDAY
2009
Springer
15 years 11 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...