683 search results - page 53 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
ESA
2003
Springer
14 years 1 months ago
2003
Springer
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
SIAMCOMP
2011
13 years 2 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
GD
1998
Springer
14 years 2 days ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
IS
2010
13 years 6 months ago
2010
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...