2252 search results - page 271 / 451 » Lower Bounds for Dynamic Algorithms |
120
Voted
ISAAC
2003
Springer
15 years 8 months ago
2003
Springer
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e ∈ E. The density of a path, say e1, e2, . . . , e...
118
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
142
Voted
GD
2001
Springer
15 years 8 months ago
2001
Springer
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a s...
122
Voted
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We consider the set Gn of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...
116
Voted
VVS
1996
IEEE
15 years 7 months ago
1996
IEEE
We propose a fast algorithm for rendering general irregular grids. Our method uses a sweep-plane approach to accelerate ray casting, and can handle disconnected and nonconvex (eve...