3475 search results - page 610 / 695 » Backbones in Optimization and Approximation |
110
click to vote
DC
2010
15 years 2 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
134
click to vote
CSDA
2008
15 years 2 months ago
2008
Non-negative Matrix Factorization (NMF) and Probabilistic Latent Semantic Indexing (PLSI) have been successfully applied to document clustering recently. In this paper, we show th...
131
click to vote
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
15 years 2 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
144
click to vote
DISOPT
2008
15 years 2 months ago
2008
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
112
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...