Sciweavers

1986 search results - page 199 / 398
» Path Separability of Graphs
Sort
View
ICASSP
2008
IEEE
14 years 4 months ago
Joint base-calling of two DNA sequences with factor graphs
—Automated estimation of DNA base-sequences is an important step in genomics and in many other emerging fields in biological and medical sciences. Current automated sequencers p...
Xiaomeng Shi, Desmond S. Lun, Jim Meldrim, Ralf K&...
ICBA
2004
Springer
271views Biometrics» more  ICBA 2004»
14 years 3 months ago
Enhance the Alignment Accuracy of Active Shape Models Using Elastic Graph Matching
Active Shape Model (ASM) is one of the most popular methods for image alignment. To improve its matching accuracy, in this paper, ASM searching method is combined with a simplifie...
Sanqiang Zhao, Wen Gao, Shiguang Shan, Baocai Yin
FOCS
1993
IEEE
14 years 2 months ago
Simulated Annealing for Graph Bisection
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
Mark Jerrum, Gregory B. Sorkin
DAM
2000
137views more  DAM 2000»
13 years 10 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
SIBGRAPI
2008
IEEE
14 years 4 months ago
Structural Matching of 2D Electrophoresis Gels using Graph Models
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...