29908 search results - page 356 / 5982 » On the complexity of communication complexity |
168
click to vote
PAKDD
2010
ACM
15 years 11 months ago
2010
ACM
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
176
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
191
click to vote
COCOON
2000
Springer
15 years 11 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
186
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
149
click to vote
APL
1998
ACM
15 years 11 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...