Sciweavers

477 search results - page 45 / 96
» Algorithms for dynamic geometric problems over data streams
Sort
View
154
Voted
VLDB
2004
ACM
134views Database» more  VLDB 2004»
15 years 8 months ago
Memory-Limited Execution of Windowed Stream Joins
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
Utkarsh Srivastava, Jennifer Widom
FOCS
2008
IEEE
15 years 9 months ago
Dynamic Connectivity: Connecting to Networks and Geometry
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
Timothy M. Chan, Mihai Patrascu, Liam Roditty
137
Voted
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
15 years 8 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
137
Voted
CVPR
2008
IEEE
16 years 5 months ago
Robust fusion of dynamic shape and normal capture for high-quality reconstruction of time-varying geometry
This paper describes a new passive approach to capture time-varying scene geometry in large acquisition volumes from multi-view video. It can be applied to reconstruct complete mo...
Naveed Ahmed, Christian Theobalt, Petar Dobrev, Ha...
INFOCOM
2003
IEEE
15 years 8 months ago
Optimal Quality Adaptation for MPEG-4 Fine-Grained Scalable Video
— Dynamic behavior of the Internet’s transmission resources makes it difficult to provide perceptually good quality of streaming video. MPEG-4 Fine-Grained Scalable coding is ...
Taehyun Kim, Mostafa H. Ammar