1480 search results - page 58 / 296 » Distributed algorithms for weighted problems in sparse graph... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
ICALP
2003
Springer
14 years 25 days ago
2003
Springer
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
COLT
2005
Springer
14 years 1 months ago
2005
Springer
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...
DAM
2010
13 years 5 months ago
2010
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...