Sciweavers

5606 search results - page 782 / 1122
» Randomization Techniques for Graphs.
Sort
View
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
15 years 5 months ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers
TAL
2010
Springer
15 years 5 months ago
Robust Semi-supervised and Ensemble-Based Methods in Word Sense Disambiguation
Mihalcea [1] discusses self-training and co-training in the context of word sense disambiguation and shows that parameter optimization on individual words was important to obtain g...
Anders Søgaard, Anders Johannsen
ACL
2010
15 years 4 months ago
Hierarchical Sequential Learning for Extracting Opinions and Their Attributes
Automatic opinion recognition involves a number of related tasks, such as identifying the boundaries of opinion expression, determining their polarity, and determining their inten...
Yejin Choi, Claire Cardie
VAMOS
2010
Springer
15 years 4 months ago
The Variability Model of The Linux Kernel
Lack of realistic benchmarks hinders efficient design and evaluation of analysis techniques for feature models. We extract a variability model from the code base of the Linux kerne...
Steven She, Rafael Lotufo, Thorsten Berger, Andrze...
GREC
2009
Springer
15 years 4 months ago
Robust and Precise Circular Arc Detection
In this paper we present a method to robustly detect circular arcs in a line drawing image. The method is fast, robust and very reliable, and is capable of assessing the quality of...
Bart Lamiroy, Yassine Guebbas