Sciweavers

324 search results - page 9 / 65
» Efficient Approximation Algorithms for Floorplan Area Minimi...
Sort
View
DAGM
2009
Springer
13 years 9 months ago
A Gradient Descent Approximation for Graph Cuts
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...
Alparslan Yildiz, Yusuf Sinan Akgul
DCG
2000
104views more  DCG 2000»
13 years 7 months ago
Efficient Algorithms for Approximating Polygonal Chains
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
Pankaj K. Agarwal, Kasturi R. Varadarajan
AAIM
2010
Springer
181views Algorithms» more  AAIM 2010»
13 years 11 months ago
Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
Binhai Zhu
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
13 years 7 months ago
Geographic Quorum System Approximations
Quorum systems are a mechanism for obtaining fault-tolerance and efficient distributed systems. We consider geographic quorum systems; a geographic quorum system is a partition of...
Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew...
ICPPW
2002
IEEE
14 years 25 days ago
Finding Multiple Routing Paths in Wide-Area WDM Networks
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
Weifa Liang, Xiaojun Shen