1963 search results - page 256 / 393 » The Maximum Solution Problem on Graphs |
94
Voted
ICIAP
2003
ACM
15 years 6 months ago
2003
ACM
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
117
click to vote
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
ISCAPDCS
2004
15 years 2 months ago
2004
This paper addresses the application of distributed constraint optimization problems (DCOPs) to large-scale dynamic environments. We introduce a decomposition of DCOP into a graph...
92
Voted
ICCV
2011
IEEE
14 years 22 days ago
2011
IEEE
We present a new framework in which image segmentation, figure/ground organization, and object detection all appear as the result of solving a single grouping problem. This frame...
90
Voted
RECOMB
2004
Springer
16 years 1 months ago
2004
Springer
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...