604 search results - page 81 / 121 » On the Complexity of the Maximum Cut Problem |
CIS
2004
Springer
15 years 3 months ago
2004
Springer
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
CSB
2003
IEEE
15 years 3 months ago
2003
IEEE
Physical map reconstruction in the presence of errors is a central problem in genetics of high computational complexity. A parallel genetic algorithm for a maximum likelihood esti...
104
click to vote
ASAP
2004
IEEE
15 years 1 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
TWC
2008
14 years 9 months ago
2008
This letter addresses the problem of joint estimation of carrier frequency offset (CFO) and channel for OFDM systems in the presence of timing ambiguity. Based on two signal models...