Sciweavers

14518 search results - page 54 / 2904
» Two Problems for Sophistication
Sort
View
IPL
2002
90views more  IPL 2002»
13 years 7 months ago
On the approximability of two tree drawing conventions
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
Paolo Penna
IJCNLP
2005
Springer
14 years 1 months ago
Two-Phase Biomedical Named Entity Recognition Using A Hybrid Method
Biomedical named entity recognition (NER) is a difficult problem in biomedical information processing due to the widespread ambiguity of terms out of context and extensive lexical ...
Seonho Kim, Juntae Yoon, Kyung-Mi Park, Hae-Chang ...
IPPS
2002
IEEE
14 years 20 days ago
Aligning Two Fragmented Sequences
Upon completion of the human and mouse genome sequences, world-wide sequencing capacity will turn to other complex organisms. Current strategies call for many of these genomes to ...
Vamsi Veeramachaneni, Piotr Berman, Webb Miller
CORR
2008
Springer
63views Education» more  CORR 2008»
13 years 7 months ago
Two Remarkable Computational Competencies of the Simple Genetic Algorithm
Since the inception of genetic algorithmics the identification of computational efficiencies of the simple genetic algorithm (SGA) has been an important goal. In this paper we dist...
Keki M. Burjorjee
AOR
2006
99views more  AOR 2006»
13 years 7 months ago
On-line bin Packing with Two Item Sizes
The problem of on-line bin packing restricted to instances with only two item sizes (known in advance) has a well-known lower bound of 4/3 for its asymptotic competitive ratio. We...
Gregory Gutin, Tommy R. Jensen, Anders Yeo