29908 search results - page 408 / 5982 » On the complexity of communication complexity |
180
click to vote
EUROCOLT
1995
Springer
15 years 10 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
177
click to vote
COCO
1991
Springer
15 years 10 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
202
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We describe a clustering approach with the emphasis on detecting coherent structures in a complex dataset, and illustrate its effectiveness with computer vision applicat...
159
click to vote
APLAS
2008
ACM
15 years 8 months ago
2008
ACM
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...
186
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...