Sciweavers

2834 search results - page 111 / 567
» Representing Trees with Constraints
Sort
View
AIME
2003
Springer
15 years 11 months ago
Multi-relational Data Mining in Medical Databases
Abstract. This paper presents the application of a method for mining data in a multi-relational database that contains some information about patients strucked down by chronic hepa...
Amaury Habrard, Marc Bernard, François Jacq...
ECML
2006
Springer
15 years 10 months ago
TildeCRF: Conditional Random Fields for Logical Sequences
Abstract. Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat al...
Bernd Gutmann, Kristian Kersting
COLING
2008
15 years 7 months ago
Shift-Reduce Dependency DAG Parsing
Most data-driven dependency parsing approaches assume that sentence structure is represented as trees. Although trees have several desirable properties from both computational and...
Kenji Sagae, Jun-ichi Tsujii
APVIS
2004
15 years 7 months ago
A Colour-Filling Approach For Visualising Trait Evolution With Phylogenies
The development of powerful visualisation tools is a major challenge in bioinformatics. Phylogenetics, a field with a growing impact on a variety of life science areas, is experie...
Savrina F. Carrizo
JSAT
2008
57views more  JSAT 2008»
15 years 6 months ago
tts: A SAT-Solver for Small, Difficult Instances
The Ternary Tree Solver (tts) is a complete solver for propositional satisfiability which was designed to have good performance on the most difficult small instances. It uses a st...
Ivor Spence