Sciweavers

156 search results - page 18 / 32
» The Complexity of the Evolution of Graph Labelings
Sort
View
ICPR
2010
IEEE
14 years 2 months ago
Integrating a Discrete Motion Model into GMM Based Background Subtraction
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
Christian Wolf, Jolion Jolion
SPAA
2009
ACM
14 years 8 months ago
Routing without ordering
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
Bernadette Charron-Bost, Antoine Gaillard, Jennife...
ICPR
2002
IEEE
14 years 8 months ago
Shape Representation Using Concavity Graphs
In this paper, a new graph data structure for 2-D shape representation is proposed. The new structure is called a concavity graph, and is an evolution from the already known "...
Ossama El Badawy, Mohamed Kamel
WABI
2009
Springer
162views Bioinformatics» more  WABI 2009»
14 years 2 months ago
Aligning Biomolecular Networks Using Modular Graph Kernels
Comparative analysis of biomolecular networks constructed using measurements from different conditions, tissues, and organisms offer a powerful approach to understanding the stru...
Fadi Towfic, M. Heather West Greenlee, Vasant Hona...
COORDINATION
2005
Springer
14 years 1 months ago
Synchronized Hyperedge Replacement for Heterogeneous Systems
Abstract. We present a framework for modelling heterogeneous distributed systems using graph transformations in the Synchronized Hyperedge Replacement approach, which describes com...
Ivan Lanese, Emilio Tuosto