995 search results - page 27 / 199 » complexity 2011 |
130
click to vote
ECCC
2011
14 years 9 months ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
JMLR
2011
14 years 9 months ago
2011
This paper presents the CLUSTERING ALGORITHMS’ REFEREE PACKAGE or CARP, an open source GNU GPL-licensed C package for evaluating clustering algorithms. Calibrating performance o...
108
click to vote
TIT
2011
14 years 9 months ago
2011
—The boomerang analysis, together with its offspring the amplified boomerang analysis and the rectangle analysis, are techniques that are widely used in the analysis of block ci...
124
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Given a Poisson process on a d-dimensional torus, its random geometric simplicial complex is the complex whose vertices are the points of the Poisson process and simplices are give...
139
click to vote
TCS
2011
14 years 9 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...