Sciweavers

1940 search results - page 206 / 388
» Graph Transformation with Variables
Sort
View
LCTRTS
2009
Springer
15 years 10 months ago
Eliminating the call stack to save RAM
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...
Xuejun Yang, Nathan Cooprider, John Regehr
136
Voted
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
16 years 4 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
150
Voted
FQAS
2009
Springer
127views Database» more  FQAS 2009»
15 years 10 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
KI
2009
Springer
15 years 10 months ago
Maximum a Posteriori Estimation of Dynamically Changing Distributions
This paper presents a sequential state estimation method with arbitrary probabilistic models expressing the system’s belief. Probabilistic models can be estimated by Maximum a po...
Michael Volkhardt, Sören Kalesse, Steffen M&u...
103
Voted
ICPR
2008
IEEE
15 years 10 months ago
Tree-serial dynamic programming for image processing
A lot of image analysis problems lend themselves to a unified mathematical formulation as optimization problems. Tree-serial dynamic programming is a particular case of the so-cal...
Andrey Kopylov