Sciweavers

2060 search results - page 92 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 4 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
166
Voted
DM
2006
128views more  DM 2006»
15 years 4 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
SC
2005
ACM
15 years 9 months ago
Multilevel Parallelism in Computational Chemistry using Common Component Architecture and Global Arrays
The development of complex scientific applications for high-end systems is a challenging task. Addressing complexity of the involved software and algorithms is becoming increasing...
Manojkumar Krishnan, Yuri Alexeev, Theresa L. Wind...
WWW
2011
ACM
14 years 11 months ago
Differences in the mechanics of information diffusion across topics: idioms, political hashtags, and complex contagion on twitte
There is a widespread intuitive sense that different kinds of information spread differently on-line, but it has been difficult to evaluate this question quantitatively since it ...
Daniel M. Romero, Brendan Meeder, Jon M. Kleinberg
SC
2000
ACM
15 years 7 months ago
Hardware Prediction for Data Coherency of Scientific Codes on DSM
This paper proposes a hardware mechanism for reducing coherency overhead occurring in scientific computations within DSM systems. A first phase aims at detecting, in the address s...
Jean-Thomas Acquaviva, William Jalby