Sciweavers

1445 search results - page 127 / 289
» Uniformly Hard Languages
Sort
View
ISOLA
2010
Springer
15 years 2 months ago
Worst-Case Analysis of Heap Allocations
In object oriented languages, dynamic memory allocation is a fundamental concept. When using such a language in hard real-time systems, it becomes important to bound both the worst...
Wolfgang Puffitsch, Benedikt Huber, Martin Schoebe...
SPEECH
2010
102views more  SPEECH 2010»
14 years 10 months ago
Non-native speech perception in adverse conditions: A review
If listening in adverse conditions is hard, then listening in a foreign language is doubly so: non-native listeners have to cope with both imperfect signals and imperfect knowledg...
Maria Luisa Garcia Lecumberri, Martin Cooke, Anne ...
173
Voted
JMLR
2012
13 years 6 months ago
Message-Passing Algorithms for MAP Estimation Using DC Programming
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
Akshat Kumar, Shlomo Zilberstein, Marc Toussaint
ICFP
2004
ACM
16 years 4 months ago
Verification of safety properties for concurrent assembly code
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
Dachuan Yu, Zhong Shao
143
Voted
PLDI
2003
ACM
15 years 9 months ago
Ownership types for safe region-based memory management in real-time Java
The Real-Time Specification for Java (RTSJ) allows a program to create real-time threads with hard real-time constraints. Real-time threads use region-based memory management to ...
Chandrasekhar Boyapati, Alexandru Salcianu, Willia...