6274 search results - page 129 / 1255 » From query complexity to computational complexity |
130
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
162
Voted
JGAA
2007
15 years 3 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
112
click to vote
CORR
1998
Springer
15 years 3 months ago
1998
Springer
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclass...
134
click to vote
TSMC
2002
15 years 3 months ago
2002
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
173
click to vote
AAMAS
2011
Springer
14 years 11 months ago
2011
Springer
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has a...