Sciweavers

3096 search results - page 531 / 620
» The Generalized FITC Approximation
Sort
View
PODS
2005
ACM
151views Database» more  PODS 2005»
16 years 6 months 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 ...
PODS
2005
ACM
211views Database» more  PODS 2005»
16 years 6 months ago
Join-distinct aggregate estimation over update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
Sumit Ganguly, Minos N. Garofalakis, Amit Kumar, R...
FOCS
2009
IEEE
16 years 1 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
CISS
2008
IEEE
16 years 1 months ago
Appropriate control of wireless networks with flow level dynamics
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
Long Le, Ravi R. Mazumdar
188
Voted
INFOCOM
2008
IEEE
16 years 1 months ago
Feasible Rate Allocation in Wireless Networks
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...