Sciweavers

3007 search results - page 341 / 602
» Linear Functional Fixed-points
Sort
View
124
Voted
FUIN
2010
143views more  FUIN 2010»
15 years 1 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer
214
Voted
SIAMIS
2011
14 years 10 months ago
Gradient-Based Methods for Sparse Recovery
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
William W. Hager, Dzung T. Phan, Hongchao Zhang
139
Voted
EUROCRYPT
2011
Springer
14 years 7 months ago
Semi-homomorphic Encryption and Multiparty Computation
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a se...
Rikke Bendlin, Ivan Damgård, Claudio Orlandi...
118
Voted
SIAMREV
2011
63views more  SIAMREV 2011»
14 years 6 months ago
Discrete Symbol Calculus
This paper deals with efficient numerical representation and manipulation of differential and integral operators as symbols in phase-space, i.e., functions of space x and frequen...
Laurent Demanet, Lexing Ying
143
Voted
MCS
2005
Springer
15 years 9 months ago
A Probability Model for Combining Ranks
Mixed Group Ranks is a parametric method for combining rank based classiers that is eective for many-class problems. Its parametric structure combines qualities of voting methods...
Ofer Melnik, Yehuda Vardi, Cun-Hui Zhang