Sciweavers

3958 search results - page 151 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
CACM
1998
110views more  CACM 1998»
15 years 6 months ago
Viewing WISs as Database Applications
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
Gustavo O. Arocena, Alberto O. Mendelzon
CSCLP
2007
Springer
16 years 16 days ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
APVIS
2009
15 years 7 months ago
A hybrid space-filling and force-directed layout method for visualizing multiple-category graphs
Many graphs used in real-world applications consist of nodes belonging to more than one category. We call such graph "multiplecategory graphs". Social networks are typic...
Takayuki Itoh, Chris Muelder, Kwan-Liu Ma, Jun Ses...
ICPR
2008
IEEE
16 years 24 days ago
Monocular video foreground segmentation system
This paper proposes an automatic foreground segmentation system based on Gaussian mixture models and dynamic graph cut algorithm. An adaptive perpixel background model is develope...
Xiaoyu Wu, Yangsheng Wang, Xiaolong Zheng
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 10 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie