Sciweavers

7167 search results - page 534 / 1434
» Answer Set Programming
Sort
View
CCCG
2010
15 years 6 months ago
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
Xiuxia Pan, Fajie Li, Reinhard Klette
ECIR
2004
Springer
15 years 6 months ago
Performance Analysis of Distributed Architectures to Index One Terabyte of Text
We simulate different architectures of a distributed Information Retrieval system on a very large Web collection, in order to work out the optimal setting for a particular set of r...
Fidel Cacheda, Vassilis Plachouras, Iadh Ounis
ACL
2001
15 years 6 months ago
Japanese Named Entity Recognition based on a Simple Rule Generator and Decision Tree Learning
Named entity (NE) recognition is a task in which proper nouns and numerical information in a document are detected and classified into categories such as person, organization, loc...
Hideki Isozaki
APBC
2003
116views Bioinformatics» more  APBC 2003»
15 years 6 months ago
An Empirical Comparison of Supervised Machine Learning Techniques in Bioinformatics
Research in bioinformatics is driven by the experimental data. Current biological databases are populated by vast amounts of experimental data. Machine learning has been widely ap...
Aik Choon Tan, David Gilbert
DAM
2007
153views more  DAM 2007»
15 years 4 months ago
Computing the minimum number of hybridization events for a consistent evolutionary history
It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...
Magnus Bordewich, Charles Semple