1327 search results - page 109 / 266 » Path following algorithm for the graph matching problem |
122
click to vote
SAC
2005
ACM
15 years 7 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
104
click to vote
GD
2004
Springer
15 years 7 months ago
2004
Springer
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
125
click to vote
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
We study the problem of event detection from realistic videos with repetitive sequential human activities. Despite the large body of work on event detection and recognition, very ...
129
click to vote
SODA
1998
ACM
15 years 3 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
115
click to vote
ISPASS
2006
IEEE
15 years 8 months ago
2006
IEEE
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...