4860 search results - page 372 / 972 » SNPs Problems, Complexity, and Algorithms |
156
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
115
Voted
ICGI
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
110
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
PRL
2002
15 years 3 months ago
2002
Pattern detection problems require a separation between two classes, Target and Clutter, where the probability of the former is substantially smaller compared to that of the latte...
133
Voted
COMGEO
2011
ACM
14 years 10 months ago
2011
ACM
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the follo...