60 search results - page 4 / 12 » Lower bounds for designs in symmetric spaces |
WDAG
1992
Springer
13 years 11 months ago
1992
Springer
Abstract. The Choice Coordination Problem with k alternatives (kCCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processe...
WCE
2007
13 years 8 months ago
2007
— The rapid transit network design problem considers at upper level the list of potential transit corridors and stations to design the network as a discrete space of alternatives...
SODA
2001
ACM
13 years 8 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
We contribute to the research on stable minimum storage merging by introducing an algorithm that is particularly simply structured compared to its competitors. The presented algori...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...