Sciweavers

109 search results - page 21 / 22
» Hamiltonian Connected Line Graphs
Sort
View
BMCBI
2010
147views more  BMCBI 2010»
13 years 7 months ago
Learning biological network using mutual information and conditional independence
Background: Biological networks offer us a new way to investigate the interactions among different components and address the biological system as a whole. In this paper, a revers...
Dong-Chul Kim, Xiaoyu Wang, Chin-Rang Yang, Jean G...
ISBI
2007
IEEE
14 years 1 months ago
3d Morphometric Changes 1 Year after Jaw Surgery
This paper presents image processing methods for the computation of morphometric changes associated with jaw surgery, precisely locating jaw displacements and quantitatively descr...
Lucia H. S. Cevidanes, Martin Andreas Styner, Ceib...
ACIVS
2006
Springer
14 years 1 months ago
Improvement of Conventional Deinterlacing Methods with Extrema Detection and Interpolation
Abstract. This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system, typically a spatio-temporal motio...
Jérôme Roussel, Pascal Bertolino, Mar...
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
13 years 8 months ago
Minimum weight convex Steiner partitions
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
Adrian Dumitrescu, Csaba D. Tóth
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
14 years 23 days ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor