Sciweavers

596 search results - page 55 / 120
» Complexity Analysis by Graph Rewriting
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
A comparative analysis of dynamic network decoding
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
David Rybach, Ralf Schlüter, Hermann Ney
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 2 months ago
Learning Preferences with Hidden Common Cause Relations
Abstract. Gaussian processes have successfully been used to learn preferences among entities as they provide nonparametric Bayesian approaches for model selection and probabilistic...
Kristian Kersting, Zhao Xu
ISMAR
2006
IEEE
14 years 2 months ago
Spatial relationship patterns: elements of reusable tracking and calibration systems
With tracking setups becoming increasingly complex, it gets more difficult to find suitable algorithms for tracking, calibration and sensor fusion. A large number of solutions e...
Daniel Pustka, Martin Huber, Manuel Bauer, Gudrun ...
ISSS
1998
IEEE
104views Hardware» more  ISSS 1998»
14 years 7 days ago
Synchronization Detection for Multi-Process Hierarchical Synthesis
Complex system specifications are often hierarchically composed of several subsystems. Each subsystem contains one or more processes. In order to provide optimization across diffe...
Oliver Bringmann, Wolfgang Rosenstiel, Dirk Reicha...
ECRTS
2009
IEEE
13 years 5 months ago
Precise Worst-Case Execution Time Analysis for Processors with Timing Anomalies
This paper explores timing anomalies in WCET analysis. Timing anomalies add to the complexity of WCET analysis and make it hard to apply divide-and-conquer strategies to simplify ...
Raimund Kirner, Albrecht Kadlec, Peter P. Puschner