Sciweavers

861 search results - page 42 / 173
» Polymorphic Time Systems for Estimating Program Complexity
Sort
View
SENSYS
2006
ACM
14 years 1 months ago
Protothreads: simplifying event-driven programming of memory-constrained embedded systems
Event-driven programming is a popular model for writing programs for tiny embedded systems and sensor network nodes. While event-driven programming can keep the memory overhead do...
Adam Dunkels, Oliver Schmidt, Thiemo Voigt, Muneeb...
LMCS
2007
132views more  LMCS 2007»
13 years 7 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
CORR
2008
Springer
124views Education» more  CORR 2008»
13 years 7 months ago
Scheduling Kalman Filters in Continuous Time
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
Jerome Le Ny, Eric Feron, Munther A. Dahleh
ISORC
2007
IEEE
14 years 1 months ago
Experiences from Applying WCET Analysis in Industrial Settings
Knowing the program timing characteristics is fundamental to the successful design and execution of real-time systems. Today, measurement-based timing analysis tools such as in-ci...
Jan Gustafsson, Andreas Ermedahl
MVA
2007
281views Computer Vision» more  MVA 2007»
13 years 9 months ago
Evaluation of Stereo Matching Systems for Real World Applications Using Structured Light for Ground Truth Estimation
In this paper we present an evaluation method for stereo matching systems and sensors especially for real world indoor applications. We estimate ground truth reference images by i...
Martin Humenberger, Daniel Hartermann, Wilfried Ku...