1206 search results - page 60 / 242 » Arc-Flags in Dynamic Graphs |
127
click to vote
ECCV
1998
Springer
16 years 5 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
121
Voted
ICPR
2000
IEEE
16 years 4 months ago
2000
IEEE
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
127
Voted
TLDI
2009
ACM
16 years 20 days ago
2009
ACM
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
152
Voted
ISLPED
2003
ACM
15 years 9 months ago
2003
ACM
We propose a novel power-aware task scheduling algorithm for DVS-enabled real-time multiprocessor systems. Unlike the existing algorithms, the proposed DVS algorithm can handle co...
191
Voted
Publication
"This paper presents an efficient algorithm for solving one sort of region-based active contour models, i.e. the active contours without edges model. We develop the link betwe...