Sciweavers

5 search results - page 1 / 1
» On Finding a Hamiltonian Path in a Tournament Using Semi-Hea...
Sort
View
ICNC
2005
Springer
13 years 10 months ago
DNA Computing for Complex Scheduling Problem
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
Mohd Saufee Muhammad, Zuwairie Ibrahim, Satomi Ued...
SCIA
2005
Springer
166views Image Analysis» more  SCIA 2005»
13 years 10 months ago
Clustering Based on Principal Curve
Clustering algorithms are intensively used in the image analysis field in compression, segmentation, recognition and other tasks. In this work we present a new approach in clusteri...
Ioan Cleju, Pasi Fränti, Xiaolin Wu
DAM
1999
128views more  DAM 1999»
13 years 4 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
RECOMB
2004
Springer
14 years 5 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...