Sciweavers

33 search results - page 2 / 7
» Manipulating Trees with Hidden Labels
Sort
View
CIKM
2008
Springer
13 years 7 months ago
A language for manipulating clustered web documents results
We propose a novel conception language for exploring the results retrieved by several internet search services (like search engines) that cluster retrieved documents. The goal is ...
Gloria Bordogna, Alessandro Campi, Giuseppe Psaila...
AUSAI
2003
Springer
13 years 10 months ago
Reduction of Non Deterministic Automata for Hidden Markov Model Based Pattern Recognition Applications
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie...
Frédéric Maire, Frank Wathne, Alain ...
ECML
2006
Springer
13 years 9 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
BMCBI
2006
150views more  BMCBI 2006»
13 years 5 months ago
TreeDyn: towards dynamic graphics and annotations for analyses of trees
Background: Analyses of biomolecules for biodiversity, phylogeny or structure/function studies often use graphical tree representations. Many powerful tree editors are now availab...
François Chevenet, Christine Brun, Anne-Lau...
CC
2003
Springer
250views System Software» more  CC 2003»
13 years 10 months ago
Automatic Detection of Uninitialized Variables
vel Meta-Reasoning with Higher-Order Abstract Syntax Alberto Momigliano, Simon Ambler. A Normalisation Result for Higher-Order Calculi with Explicit Substitutions Eduardo Bonelli. ...
Thi Viet Nga Nguyen, François Irigoin, Cori...