1480 search results - page 76 / 296 » Distributed algorithms for weighted problems in sparse graph... |
131
click to vote
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
117
Voted
SOSP
2009
ACM
15 years 9 months ago
2009
ACM
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
119
Voted
COCOA
2009
Springer
15 years 4 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
99
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
115
Voted
IJCV
2006
15 years 21 days ago
2006
Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation e...