Sciweavers

1941 search results - page 194 / 389
» On the Hardness of Approximate Reasoning
Sort
View
SEFM
2006
IEEE
16 years 15 days ago
A Theory of Singly-Linked Lists and its Extensible Decision Procedure
The key to many approaches to reason about pointerbased data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encomp...
Silvio Ranise, Calogero G. Zarba
AVSS
2005
IEEE
16 years 3 days ago
Multiple object tracking using elastic matching
A novel region-based multiple object tracking framework based on Kalman filtering and elastic matching is proposed. The proposed Kalman filtering-elastic matching model is gener...
Xingzhi Luo, Suchendra M. Bhandarkar
LICS
2005
IEEE
16 years 2 days ago
Inverse and Implicit Functions in Domain Theory
We construct a domain-theoretic calculus for Lipschitz and differentiable functions, which includes addition, subtraction and composition. We then develop a domaintheoretic versio...
Abbas Edalat, Dirk Pattinson
CD
2005
Springer
16 years 1 days ago
A Decentralized Redeployment Algorithm for Improving the Availability of Distributed Systems
In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall a...
Sam Malek, Marija Mikic-Rakic, Nenad Medvidovic
ICIAR
2005
Springer
16 years 3 hour ago
A Novel Tracking Framework Using Kalman Filtering and Elastic Matching
A novel region-based multiple object tracking framework based on Kalman filtering and elastic matching is proposed. The proposed Kalman filtering-elastic matching model is genera...
Xingzhi Luo, Suchendra M. Bhandarkar