Sciweavers

3 search results - page 1 / 1
» Reconstructive Dispersers and Hitting Set Generators
Sort
View
71
Voted
APPROX
2005
Springer
79views Algorithms» more  APPROX 2005»
15 years 3 months ago
Reconstructive Dispersers and Hitting Set Generators
Abstract. We give a generic construction of an optimal hitting set generator (HSG) from any good “reconstructive” disperser. Past constructions of optimal HSGs have been based ...
Christopher Umans
COMPGEOM
2005
ACM
14 years 11 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
ISCA
2009
IEEE
158views Hardware» more  ISCA 2009»
15 years 4 months ago
Boosting single-thread performance in multi-core systems through fine-grain multi-threading
Industry has shifted towards multi-core designs as we have hit the memory and power walls. However, single thread performance remains of paramount importance since some applicatio...
Carlos Madriles, Pedro López, Josep M. Codi...