214 search results - page 29 / 43 » The node capacitated graph partitioning problem: A computati... |
143
Voted
PR
2007
15 years 3 months ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
136
Voted
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
191
Voted
CVPR
2010
IEEE
15 years 12 months ago
2010
IEEE
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
150
Voted
SOSP
2009
ACM
16 years 15 days 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 ...
139
Voted
MOBIHOC
2005
ACM
16 years 3 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...