Sciweavers

1024 search results - page 105 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
BMCBI
2008
148views more  BMCBI 2008»
15 years 2 months ago
Critical assessment of alignment procedures for LC-MS proteomics and metabolomics measurements
Background: Liquid chromatography coupled to mass spectrometry (LC-MS) has become a prominent tool for the analysis of complex proteomics and metabolomics samples. In many applica...
Eva Lange, Ralf Tautenhahn, Steffen Neumann, Cleme...
COMGEO
2006
ACM
15 years 2 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
JACM
2006
99views more  JACM 2006»
15 years 2 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
PAMI
2008
161views more  PAMI 2008»
15 years 2 months ago
TRUST-TECH-Based Expectation Maximization for Learning Finite Mixture Models
The Expectation Maximization (EM) algorithm is widely used for learning finite mixture models despite its greedy nature. Most popular model-based clustering techniques might yield...
Chandan K. Reddy, Hsiao-Dong Chiang, Bala Rajaratn...
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 6 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam