1480 search results - page 206 / 296 » Distributed algorithms for weighted problems in sparse graph... |
130
click to vote
HPCC
2011
Springer
14 years 17 days ago
2011
Springer
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
105
click to vote
STOC
2007
ACM
16 years 1 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
126
click to vote
ISAAC
2007
Springer
15 years 7 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
110
click to vote
CIE
2007
Springer
15 years 7 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
111
click to vote
TKDE
2008
15 years 24 days ago
2008
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...