41 search results - page 4 / 9 » Union-Find with Constant Time Deletions |
SCVMA
2004
Springer
14 years 10 days ago
2004
Springer
Abstract. In this paper we present a generative model for image sequences, which can be applied to motion segmentation and tracking, and to image sequence compression. The model co...
PODS
2004
ACM
14 years 7 months ago
2004
ACM
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
RT
2000
Springer
13 years 10 months ago
2000
Springer
Acceleration structures used for ray tracing have been designed and optimized for efficient traversal of static scenes. As it becomes feasible to do interactive ray tracing of movi...
MST
2010
13 years 1 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
STOC
2010
ACM
14 years 4 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...