Sciweavers

3758 search results - page 49 / 752
» A Complete Subsumption Algorithm
Sort
View
ISMB
2000
13 years 9 months ago
Computation and Visualization of Degenerate Repeats in Complete Genomes
The repetitive structure of genomic DNA holds many secrets to be discovered. A systematic study of repetitive DNA on a genomic or inter-genomic scale requires extensive algorithmi...
Stefan Kurtz, Enno Ohlebusch, Chris Schleiermacher...
ORL
2002
81views more  ORL 2002»
13 years 7 months ago
On-line scheduling of unit time jobs with rejection: minimizing the total completion time
We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, o...
Leah Epstein, John Noga, Gerhard J. Woeginger
COLING
2008
13 years 9 months ago
A Uniform Approach to Analogies, Synonyms, Antonyms, and Associations
Recognizing analogies, synonyms, antonyms, and associations appear to be four distinct tasks, requiring distinct NLP algorithms. In the past, the four tasks have been treated inde...
Peter D. Turney
ACCV
1998
Springer
13 years 12 months ago
Optimising the Complete Image Feature Extraction Chain
The hypothesis veri cation stage of the traditional image processing approach, consisting of low, medium, and high level processing, will su er if the set of low level features ext...
Majid Mirmehdi, Phil L. Palmer, Josef Kittler
CORR
2010
Springer
81views Education» more  CORR 2010»
13 years 2 months ago
Analysis of Agglomerative Clustering
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
Marcel R. Ackermann, Johannes Blömer, Daniel ...