5115 search results - page 945 / 1023 » On Randomized Lanczos Algorithms |
146
click to vote
PODS
2005
ACM
16 years 2 months ago
2005
ACM
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...
122
Voted
EDBT
2004
ACM
16 years 2 months ago
2004
ACM
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
118
Voted
EDBT
2006
ACM
16 years 2 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
126
Voted
MOBIHOC
2007
ACM
16 years 2 months ago
2007
ACM
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
111
Voted
SODA
2010
ACM
16 years 17 hour ago
2010
ACM
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...