Sciweavers

2066 search results - page 111 / 414
» Word Maturity: Computational Modeling of Word Knowledge
Sort
View
ENTCS
2006
137views more  ENTCS 2006»
14 years 10 months ago
An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...
Morgan Magnin, Didier Lime, Olivier H. Roux
IANDC
2010
67views more  IANDC 2010»
14 years 8 months ago
Parameterized computational complexity of Dodgson and Young elections
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
Nadja Betzler, Jiong Guo, Rolf Niedermeier
SGAI
2009
Springer
15 years 4 months ago
From Source Code to Runtime Behaviour: Software Metrics Help to Select the Computer Architecture
The decision which hardware platform to use for a certain application is an important problem in computer architecture. This paper reports on a study where a data-mining approach i...
Frank Eichinger, David Kramer, Klemens Böhm, ...
TASLP
2010
97views more  TASLP 2010»
14 years 4 months ago
Hierarchical Bayesian Language Models for Conversational Speech Recognition
Traditional n-gram language models are widely used in state-of-the-art large vocabulary speech recognition systems. This simple model suffers from some limitations, such as overfi...
Songfang Huang, Steve Renals
COMPSYSTECH
2007
15 years 1 months ago
A refinement model with information granulation focused on difficult to distinguish cases
: The paper proposes a different approach to data modeling. Analogous to the rejection method, where the misclassifications are removed and manually evaluated, we focus here on dif...
Plamena Andreeva, Plamen Andreev, Maya Dimitrova, ...