8695 search results - page 1396 / 1739 » Making the Complex Simple |
153
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
121
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
139
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
143
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
129
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...