1722 search results - page 118 / 345 » On the sample mean of graphs |
163
click to vote
IEEEPACT
2002
IEEE
15 years 11 months ago
2002
IEEE
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 ...
162
click to vote
PR
2000
2000
A region-level motion-based graph representation and labeling for tracking a spatial image partition
15 years 6 months ago
This paper addresses two image sequence analysis issues under a common framework. These tasks are, "rst, motion-based segmentation and second, updating and tracking over time...
151
click to vote
TVLSI
2002
15 years 6 months ago
2002
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...
140
click to vote
SAC
2008
ACM
15 years 5 months ago
2008
ACM
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
189
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...