1327 search results - page 202 / 266 » Path following algorithm for the graph matching problem |
129
click to vote
IANDC
2008
15 years 1 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
128
Voted
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
109
click to vote
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—Tracking mobile targets using sensor networks is a challenging task because of the impacts of in-the-filed factors such as environment noise, sensing irregularity and etc. This...
299
click to vote
CVPR
2011
IEEE
14 years 9 months ago
2011
IEEE
This paper addresses the problem of simultaneous tracking of multiple targets in a video. We first apply object detectors to every video frame. Pairs of detection responses from ...