3897 search results - page 714 / 780 » complexity 2010 |
STOC
2010
ACM
14 years 1 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
ICALP
2010
Springer
14 years 27 days ago
2010
Springer
A data structure is presented for the Mergeable Dictionary abstract data type, which supports the following operations on a collection of disjoint sets of totally ordered data: Pr...
STOC
2010
ACM
14 years 25 days ago
2010
ACM
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
APGV
2010
ACM
14 years 24 days ago
2010
ACM
The human visual system is able to quickly and robustly infer a wealth of scene information – the scene "gist" – already after 100 milliseconds of image presentation...