Sciweavers

16404 search results - page 572 / 3281
» A set coverage problem
Sort
View
JCDL
2005
ACM
95views Education» more  JCDL 2005»
16 years 17 days ago
Resolving the unencoded character problem for chinese digital libraries
Constructing a Chinese digital library, especially for a historical article archiving, is often bothered by the small character sets supported by the current computer systems. Thi...
Derming Juang, Jenq-Haur Wang, Chen-Yu Lai, Ching-...
CPM
2004
Springer
145views Combinatorics» more  CPM 2004»
16 years 12 days ago
Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs
The perfect phylogeny model for haplotype evolution has been successfully applied to haplotype resolution from genotype data. In this study we explore the application of the perfe...
Tamar Barzuza, Jacques S. Beckmann, Ron Shamir, It...
GECCO
2003
Springer
16 years 6 days ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene
CIKM
2009
Springer
15 years 11 months ago
Improving binary classification on text problems using differential word features
We describe an efficient technique to weigh word-based features in binary classification tasks and show that it significantly improves classification accuracy on a range of proble...
Justin Martineau, Tim Finin, Anupam Joshi, Shamit ...
CCGRID
2006
IEEE
15 years 9 months ago
Biodiversity World: A Problem-Solving Environment for Analysing Biodiversity Patterns
In the Biodiversity World (BDW) project we have created a flexible and extensible Web Services-based Grid environment for biodiversity researchers to solve problems in biodiversity...
Jaspreet Singh Pahwa, Peter Brewer, Tim Sutton, Ch...