4926 search results - page 578 / 986 » Two Graph Algorithms On an Associative Computing Model |
142
click to vote
MIR
2004
ACM
15 years 8 months ago
2004
ACM
This paper proposes a new approach and algorithm for the similarity measure of video clips. The similarity is mainly based on two bipartite graph matching algorithms: maximum matc...
149
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
138
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— We consider the problem of throughput-optimal cross-layer design of wireless networks. We propose a joint congestion control and scheduling algorithm that achieves a fraction d...
149
click to vote
DIALM
2004
ACM
15 years 8 months ago
2004
ACM
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
131
click to vote
AAAI
2011
14 years 3 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...