Sciweavers

7006 search results - page 1326 / 1402
» Approximation Algorithms
Sort
View
100
Voted
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
16 years 1 months ago
Concurrent general composition of secure protocols in the timing model
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
177
Voted
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
16 years 27 days ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
193
Voted
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
16 years 27 days ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
127
Voted
PODS
2005
ACM
151views Database» more  PODS 2005»
16 years 26 days ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
96
Voted
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
15 years 10 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
« Prev « First page 1326 / 1402 Last » Next »