1262 search results - page 53 / 253 » Diagnosis Problem Solving Using Fuzzy Relations |
117
Voted
DCC
2002
IEEE
16 years 2 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
114
Voted
TCBB
2008
15 years 2 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
127
click to vote
ICCV
2007
IEEE
16 years 4 months ago
2007
IEEE
Most 3D reconstruction solutions focus on surfaces, and there has not been much research attention paid to the problem of reconstructing 3D scenes made up of large numbers of part...
112
click to vote
ISSAC
2004
Springer
15 years 8 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
136
click to vote
ICNC
2005
Springer
15 years 8 months ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...