Sciweavers

3172 search results - page 276 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
DCC
2008
IEEE
16 years 6 months ago
On vector space partitions and uniformly resolvable designs
Let Vn(q) denote a vector space of dimension n over the field with q elements. A set P of subspaces of Vn(q) is a partition of Vn(q) if every nonzero vector in Vn(q) is contained ...
Andrew Blinco, Saad El-Zanati, G. F. Seelinger, P....
157
Voted
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
16 years 4 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
ICDT
2010
ACM
180views Database» more  ICDT 2010»
16 years 4 months ago
Foundations of SPARQL Query Optimization
We study fundamental aspects related to the efficient processing of the SPARQL query language for RDF, proposed by the W3C to encode machine-readable information in the Semantic W...
Michael Schmidt, Michael Meier, Georg Lausen
ICS
2010
Tsinghua U.
16 years 4 months ago
Cache Replacement Policies for Multicore Processors
Almost all of the modern computers use multiple cores, and the number of cores is expected to increase as hardware prices go down, and Moore's law fails to hold. Most of the ...
Avinatan Hassidim
ASAP
2009
IEEE
143views Hardware» more  ASAP 2009»
16 years 3 months ago
Scalar Processing Overhead on SIMD-Only Architectures
—The Cell processor consists of a general-purpose core and eight cores with a complete SIMD instruction set. Although originally designed for multimedia and gaming, it is current...
Arnaldo Azevedo Filho, Ben H. H. Juurlink