Sciweavers

129 search results - page 15 / 26
» The Parameterized Complexity of the Minimum Shared Edges Pro...
Sort
View
65
Voted
ICIP
2010
IEEE
14 years 7 months ago
Fast and robust active contours for image segmentation
Active models are widely used in applications like image segmentation and tracking. Region-based active models are known for robustness to weak edges and high computational comple...
Wei Yu, Franz Franchetti, Yao-Jen Chang, Tsuhan Ch...
INFOCOM
2006
IEEE
15 years 3 months ago
Complexity of Wavelength Assignment in Optical Network Optimization
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
Matthew Andrews, Lisa Zhang
DAC
1999
ACM
15 years 1 months ago
Exact Memory Size Estimation for Array Computations without Loop Unrolling
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
Ying Zhao, Sharad Malik
CPM
2010
Springer
120views Combinatorics» more  CPM 2010»
15 years 2 months ago
Mod/Resc Parsimony Inference
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...
Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Eng...
CORR
2004
Springer
119views Education» more  CORR 2004»
14 years 9 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham