Sciweavers

1165 search results - page 77 / 233
» Effective linear programming based placement methods
Sort
View
CVPR
2010
IEEE
15 years 10 months ago
Convex Shape Decomposition
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
Liu Hairong, Longin Jan Latecki, Liu Wenyu
NIPS
2008
15 years 3 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr
ICASSP
2011
IEEE
14 years 6 months ago
One sentence voice adaptation using GMM-based frequency-warping and shift with a sub-band basis spectrum model
This paper presents a rapid voice adaptation algorithm using GMM-based frequency warping and shift with parameters of a subband basis spectrum model (SBM)[1]. The SBM parameter re...
Masatsune Tamura, Masahiro Morita, Takehiko Kagosh...
ISMB
1994
15 years 3 months ago
An Efficient Method for Multiple Sequence Alignment
Multiple sequence alignment has been a useful methodin the study of molecular evolution and sequence-structure relationships. This paper presents a newmethodfor multiple sequence ...
Jin Kim, Sakti Pramanik
ISBRA
2010
Springer
15 years 9 months ago
Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees
Abstract. Hybridization is a reticulate evolutionary process. An established problem on hybridization is computing the minimum number of hybridization events, called the hybridizat...
Yufeng Wu, Jiayin Wang