1327 search results - page 70 / 266 » Path following algorithm for the graph matching problem |
127
click to vote
MOBIHOC
2004
ACM
16 years 1 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
119
click to vote
COCOON
2001
Springer
15 years 6 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
121
click to vote
MDM
2010
Springer
15 years 6 months ago
2010
Springer
—Matching a raw GPS trajectory to roads on a digital map is often referred to as the Map Matching problem. However, the occurrence of the low-sampling-rate trajectories (e.g. one...
120
click to vote
BMCBI
2007
15 years 1 months ago
2007
Background: Matching functional sites is a key problem for the understanding of protein function and evolution. The commonly used graph theoretic approach, and other related appro...
131
click to vote
ICST
2009
IEEE
15 years 8 months ago
2009
IEEE
The problem of testing from an extended finite state machine (EFSM) can be expressed in terms of finding suitable paths through the EFSM and then deriving test data to follow the ...