82 search results - page 2 / 17 » A Lagrangian Relaxation Approach for the Multiple Sequence A... |
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
This paper describes a new approximate maximum-likelihood (ML) MIMO detection approach by studying a Lagrangian dual relaxation (LDR) of ML. Unlike many existing relaxed ML method...
PPSN
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. The multiple sequence alignment problem (MSA) can be reformulated as the problem of finding a maximum weight trace in an alignment graph, which is derived from all pairw...
ISPD
2000
ACM
13 years 9 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
ICCAD
2003
IEEE
14 years 2 months ago
2003
IEEE
Routing for FPGAs has been a very challenging problem due to the limitation of routing resources. Although the FPGA routing problem has been researched extensively, most algorithm...
ACCV
2007
Springer
13 years 9 months ago
2007
Springer
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...