Sciweavers

1257 search results - page 108 / 252
» A generalization of Euler's constant
Sort
View
PODC
2010
ACM
14 years 2 months ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
13 years 11 months ago
On-Line File Caching
Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of ...
Neal E. Young
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 10 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
SIAMAM
2000
90views more  SIAMAM 2000»
13 years 9 months ago
Local Strong Homogeneity of a Regularized Estimator
This paper deals with regularized pointwise estimation of discrete signals which contain large strongly homogeneous zones, where typically they are constant, or linear, or more gen...
Mila Nikolova
CORR
2010
Springer
86views Education» more  CORR 2010»
13 years 8 months ago
Secure Multiparty Computation with Partial Fairness
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
Amos Beimel, Eran Omri, Ilan Orlov