Sciweavers

1093 search results - page 37 / 219
» Clustering from Constraint Graphs
Sort
View
IEEEPACT
2002
IEEE
14 years 2 months ago
Exploiting Pseudo-Schedules to Guide Data Dependence Graph Partitioning
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
Alex Aletà, Josep M. Codina, F. Jesú...
CVPR
2009
IEEE
15 years 5 months ago
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
This paper studies a framework for matching an unknown number of corresponding structures in two images (shapes), motivated by detecting objects in cluttered background and lear...
Kun Zeng, Liang Lin, Song Chun Zhu, Xiaobai Liu
APVIS
2004
13 years 11 months ago
Adding Filtering to Geometric Distortion to Visualize a Clustered Graph on Small Screens.
Presenting large amounts of information in a limited screen space is a significant challenge in the field of Information Visualization. With the rapid development and growing use ...
Wanchun Li, Masahiro Takatsuka
CONSTRAINTS
2010
110views more  CONSTRAINTS 2010»
13 years 7 months ago
Solving subgraph isomorphism problems with constraint programming
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Stéphane Zampelli, Yves Deville, Christine ...
SOCIALCOM
2010
13 years 7 months ago
Graph Comparison Using Fine Structure Analysis
We introduce a novel technique for comparing graphs using the structure of their subgraphs, which we call a graph's fine structure. Our technique compares graphs using the ear...
Owen Macindoe, Whitman Richards