Sciweavers

1000 search results - page 134 / 200
» Dependency Tree Automata
Sort
View
150
Voted
ICFP
2006
ACM
16 years 2 months ago
A pattern for almost compositional functions
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
Aarne Ranta, Björn Bringert
NOMS
2002
IEEE
130views Communications» more  NOMS 2002»
15 years 7 months ago
End-to-end service failure diagnosis using belief networks
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
Malgorzata Steinder, Adarshpal S. Sethi
163
Voted
INTERSPEECH
2010
14 years 9 months ago
Memory-based active learning for French broadcast news
Stochastic dependency parsers can achieve very good results when they are trained on large corpora that have been manually annotated. Active learning is a procedure that aims at r...
Frédéric Tantini, Christophe Cerisar...
195
Voted
FASE
2012
Springer
13 years 10 months ago
Integration Testing of Software Product Lines Using Compositional Symbolic Execution
Software product lines are families of products defined by feature commonality and variability, with a well-managed asset base. Recent work in testing of software product lines ha...
Jiangfan Shi, Myra B. Cohen, Matthew B. Dwyer
109
Voted
PERCOM
2004
ACM
16 years 2 months ago
PCOM - A Component System for Pervasive Computing
Applications in the Pervasive Computing domain are challenged by the dynamism in which their execution environment changes, e.g. due to user mobility. As a result, applications ha...
Christian Becker, Marcus Handte, Gregor Schiele, K...