1213 search results - page 112 / 243 » Approximation in quantale-enriched categories |
STOC
2003
ACM
15 years 11 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
STOC
2003
ACM
15 years 11 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
154
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
PODS
2006
ACM
15 years 10 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
EDBT
2008
ACM
15 years 10 months ago
2008
ACM
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...