Sciweavers

4114 search results - page 37 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
ICML
1998
IEEE
16 years 5 months ago
An Efficient Boosting Algorithm for Combining Preferences
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
Yoav Freund, Raj D. Iyer, Robert E. Schapire, Yora...
ICPP
2007
IEEE
15 years 10 months ago
Efficient Parallel Algorithm for Optimal Three-Sequences Alignment
Sequence alignment is a fundamental problem in the computational biology. Many alignment methods have been proposed in the literature, such as pair-wise sequence alignment (2SA), ...
Chun-Yuan Lin, Chen Tai Huang, Yeh-Ching Chung, Ch...
TSP
2010
14 years 11 months ago
Efficient Maximum Entropy Reconstruction of Nuclear Magnetic Resonance T1-T2 Spectra
Abstract--This paper deals with the reconstruction of T1-T2 correlation spectra in nuclear magnetic resonance relaxometry. The ill-posed character and the large size of this invers...
Emilie Chouzenoux, Saïd Moussaoui, Jér...
AAIM
2010
Springer
181views Algorithms» more  AAIM 2010»
15 years 7 months ago
Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
Binhai Zhu
ICWS
2008
IEEE
15 years 5 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan