Sciweavers

2924 search results - page 65 / 585
» Lower Bounds in Distributed Computing
Sort
View
ECCC
2007
69views more  ECCC 2007»
13 years 8 months ago
Testing Symmetric Properties of Distributions
We introduce the notion of a Canonical Tester for a class of properties on distributions, that is, a tester strong and general enough that “a distribution property in the class ...
Paul Valiant
TPDS
1998
92views more  TPDS 1998»
13 years 8 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu
MFCS
2007
Springer
14 years 3 months ago
Semisimple Algebras of Almost Minimal Rank over the Reals
Abstract. A famous lower bound for the bilinear complexity of the multiplication in associative algebras is the Alder–Strassen bound. Algebras for which this bound is tight are c...
Markus Bläser, Andreas Meyer de Voltaire
EUC
2007
Springer
14 years 3 months ago
Consensus-Driven Distributable Thread Scheduling in Networked Embedded Systems
We demonstrate an improved consensus-driven utility accrual scheduling algorithm (DUA-CLA) for distributable threads which execute under run-time uncertainties in execution time, ...
Jonathan Stephen Anderson, Binoy Ravindran, E. Dou...
DLT
2009
13 years 6 months ago
Tight Bounds on the Descriptional Complexity of Regular Expressions
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
Hermann Gruber, Markus Holzer