Sciweavers

206 search results - page 1 / 42
» A nonblocking set optimized for querying the minimum value
Sort
View
PODC
2011
ACM
12 years 7 months ago
A nonblocking set optimized for querying the minimum value
We present the Mindicator, a set implementation customized for shared memory runtime systems. The Mindicator is optimized for constant-time querying of its minimum element, while ...
Yujie Liu, Michael F. Spear
LATIN
2010
Springer
13 years 11 months ago
Optimal Succinctness for Range Minimum Queries
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...
Johannes Fischer
TPDS
1998
124views more  TPDS 1998»
13 years 4 months ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad
ADBIS
2010
Springer
140views Database» more  ADBIS 2010»
13 years 4 months ago
Estimation of the Maximum Domination Value in Multi-dimensional Data Sets
Abstract. The last years there is an increasing interest for query processing techniques that take into consideration the dominance relationship between objects to select the most ...
Eleftherios Tiakas, Apostolos N. Papadopoulos, Yan...
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
13 years 8 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos