Sciweavers

1493 search results - page 146 / 299
» Local resilience of graphs
Sort
View
ACSC
2003
IEEE
14 years 1 months ago
Force-Transfer: A New Approach to Removing Overlapping Nodes in Graph Layout
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...
Xiaodi Huang, Wei Lai
COMPLEX
2009
Springer
13 years 12 months ago
Capturing Internet Traffic Dynamics through Graph Distances
Studies of the Internet have typically focused either on the routing system, i.e. the paths chosen to reach a given destination, or on the evolution of traffic on a physical link. ...
Steve Uhlig, Bingjie Fu, Almerima Jamakovic
ECCV
2008
Springer
13 years 9 months ago
Reformulating and Optimizing the Mumford-Shah Functional on a Graph - A Faster, Lower Energy Solution
Active contour formulations predominate current minimization of the Mumford-Shah functional (MSF) for image segmentation and filtering. Unfortunately, these formulations necessitat...
Leo Grady, Christopher V. Alvino
GG
2008
Springer
13 years 9 months ago
Formal Analysis of Model Transformations Based on Triple Graph Rules with Kernels
Abstract. Triple graph transformation has become an important approach for model transformations. Triple graphs consist of a source, a target and a connection graph. The correspond...
Hartmut Ehrig, Ulrike Prange
TCSV
2008
202views more  TCSV 2008»
13 years 8 months ago
Probabilistic Object Tracking With Dynamic Attributed Relational Feature Graph
Object tracking is one of the fundamental problems in computer vision and has received considerable attention in the past two decades. The success of a tracking algorithm relies on...
Feng Tang, Hai Tao