420 search results - page 67 / 84 » Some Algorithmic Problems in Polytope Theory |
85
Voted
EUROCOLT
1999
Springer
15 years 1 months ago
1999
Springer
Many settings of unsupervised learning can be viewed as quantization problems — the minimization of the expected quantization error subject to some restrictions. This allows the ...
102
click to vote
FOCS
1998
IEEE
15 years 1 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
JCO
2006
14 years 9 months ago
2006
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
SIAMJO
2010
14 years 8 months ago
2010
Proximal bundle methods have been shown to be highly successful optimization methods for unconstrained convex problems with discontinuous first derivatives. This naturally leads ...
PRICAI
2010
Springer
14 years 7 months ago
2010
Springer
Unlike traditional classification tasks, multilabel classification allows a sample to associate with more than one label. This generalization naturally arises the difficulty in cla...