1884 search results - page 292 / 377 » Simple Algorithm for Simple Timed Games |
RECOMB
2004
Springer
15 years 10 months ago
2004
Springer
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
RECOMB
1997
Springer
15 years 2 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
91
Voted
FUIN
2006
14 years 10 months ago
2006
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
CVPR
2007
IEEE
16 years 5 days ago
2007
IEEE
We propose a method that dramatically improves the performance of template-based matching in terms of size of convergence region and computation time. This is done by selecting a ...