Sciweavers

2200 search results - page 33 / 440
» Bloch's Constant is Computable
Sort
View
DCC
2006
IEEE
15 years 9 months ago
Codes with a Certain Weight-preserving Transitive Group of Automorphisms
We determine all linear codes C containing the constant code E, for which there is a weight-preserving group of semilinear automorphisms which acts transitively on the set of nont...
Michael Giudici
SPAA
1993
ACM
15 years 1 months ago
On Gazit and Miller's Parallel Algorithm for Planar Separators: Achieving Greater Efficiency Through Random Sampling
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
Philip N. Klein
WSC
1997
14 years 11 months ago
Computational Efficiency Evaluation in Output Analysis
A central quantity in steady-state simulation is the time-average variance constant. Estimates of this quantity are needed (for example) for constructing confidence intervals, an...
Halim Damerdji, Shane G. Henderson, Peter W. Glynn
CC
2005
Springer
103views System Software» more  CC 2005»
14 years 9 months ago
Valiant's model and the cost of computing integers
Let (n) be the minimum number of arithmetic operations required to build the integer n N from the constants 1 and 2. A sequence xn is said to be "easy to compute" if the...
Pascal Koiran
PC
2007
133views Management» more  PC 2007»
14 years 9 months ago
Data distribution for dense factorization on computers with memory heterogeneity
In this paper, we study the problem of optimal matrix partitioning for parallel dense factorization on heterogeneous processors. First, we outline existing algorithms solving the ...
Alexey L. Lastovetsky, Ravi Reddy