2612 search results - page 133 / 523 » Assemblies as Graph Processes |
166
click to vote
PR
2006
15 years 6 months ago
2006
We present a novel multiscale clustering algorithm inspired by algebraic multigrid techniques. Our method begins with assembling data points according to local similarities. It us...
211
click to vote
DASIP
2010
15 years 1 months ago
2010
Nowadays, the design flow of complex signal processing embedded systems starts with a specification of the application by means of a large and sequential program (usually in C/C++...
174
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute i...
170
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
171
click to vote
CAAN
2007
Springer
16 years 18 days ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...