882 search results - page 139 / 177 » On the Hardness of Graph Isomorphism |
156
click to vote
FSTTCS
2009
Springer
16 years 11 days ago
2009
Springer
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
146
click to vote
PKDD
2009
Springer
16 years 10 days ago
2009
Springer
Co-clustering has emerged as an important technique for mining contingency data matrices. However, almost all existing coclustering algorithms are hard partitioning, assigning each...
150
click to vote
IPPS
2008
IEEE
16 years 6 days ago
2008
IEEE
Abstract— The use of many distributed, heterogeneous resources as a large collective platform offers great potential. A key issue for these grid platforms is middleware scalabili...
152
click to vote
INFOCOM
2007
IEEE
16 years 3 days ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
142
click to vote
INFOCOM
2007
IEEE
16 years 2 days ago
2007
IEEE
—Geographic routing protocols like GOAFR or GPSR rely on exact location information at the nodes, because when the greedy routing phase gets stuck at a local minimum, they requir...