951 search results - page 30 / 191 » On the Computation of Correctly-Rounded Sums |
72
Voted
TRANSCI
2008
14 years 10 months ago
2008
The traffic assignment problem with elastic demands can be formulated as an optimization problem, whose objective is sum of a congestion function and a disutility function. We pro...
108
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
67
Voted
SDM
2009
SIAM
15 years 7 months ago
2009
SIAM
Most existing work on Privacy-Preserving Data Mining (PPDM) focus on enabling conventional data mining algorithms with the ability to run in a secure manner in a multi-party setti...
68
Voted
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We suggest that extending Muller games with preference ordering for players is a natural way to reason about unbounded duration games. In this context, we look at the standard solu...
FCT
2009
Springer
15 years 4 months ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...