1951 search results - page 283 / 391 » An algorithm for improving graph partitions |
137
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
149
Voted
EUROGRAPHICS
2010
Eurographics
16 years 15 days ago
2010
Eurographics
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
140
click to vote
CSE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—Collaborative or “Social” filtering has been successfully deployed over the years as a technique for analysing large amounts of user-preference knowledge to predict...
115
click to vote
JSSPP
2009
Springer
15 years 11 months ago
2009
Springer
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interproc...
148
click to vote
FCT
1993
Springer
15 years 8 months ago
1993
Springer
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...