14518 search results - page 214 / 2904 » Two Problems for Sophistication |
103
Voted
TCS
2011
14 years 7 months ago
2011
During the last years, the genomes of more and more species have been sequenced, providing data for phylogenetic reconstruction based on genome rearrangement measures, where the m...
108
click to vote
ICPR
2000
IEEE
16 years 1 months ago
2000
IEEE
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
95
Voted
ICFP
2003
ACM
16 years 20 days ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
98
Voted
ICIP
2008
IEEE
15 years 7 months ago
2008
IEEE
In several imaging inverse problems, it may be of interest to encourage the solution to have characteristics which are most naturally expressed by the combination of more than one...
64
Voted
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
Abstract. In this paper, we consider parallelizability of some Pcomplete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We pr...