1254 search results - page 248 / 251 » Making Hard Problems Harder |
SIGMETRICS
2012
ACM
11 years 10 months ago
2012
ACM
Sampling is crucial for controlling resource consumption by internet traffic flow measurements. Routers use Packet Sampled NetFlow [9], and completed flow records are sampled in...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
Querying uncertain data has emerged as an important problem in data management due to the imprecise nature of many measurement data. In this paper we study answering range queries...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
STOC
2005
ACM
14 years 1 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...