Sciweavers

196 search results - page 30 / 40
» Approximating weighted matchings in parallel
Sort
View
ICDCS
2009
IEEE
15 years 6 months ago
MOPS: Providing Content-Based Service in Disruption-Tolerant Networks
—Content-based service, which dynamically routes and delivers events from sources to interested users, is extremely important to network services. However, existing content-based...
Feng Li, Jie Wu
84
Voted
EMNLP
2008
14 years 11 months ago
Online Large-Margin Training of Syntactic and Structural Translation Features
Minimum-error-rate training (MERT) is a bottleneck for current development in statistical machine translation because it is limited in the number of weights it can reliably optimi...
David Chiang, Yuval Marton, Philip Resnik
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
15 years 4 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
14 years 11 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
TCBB
2008
126views more  TCBB 2008»
14 years 9 months ago
Combinatorial Approaches for Mass Spectra Recalibration
Mass spectrometry has become one of the most popular analysis techniques in Proteomics and Systems Biology. With the creation of larger data sets, the automated recalibration of ma...
Sebastian Böcker, Veli Mäkinen