Sciweavers

1941 search results - page 231 / 389
» On the Hardness of Approximate Reasoning
Sort
View
MICCAI
2009
Springer
16 years 7 months ago
Dynamic Cone Beam Reconstruction Using a New Level Set Formulation
Abstract. This paper addresses an approach toward tomographic reconstruction from rotational angiography data as it is generated by Carms in cardiac imaging. Since the rotational a...
Andreas Keil, Jakob Vogel, Günter Lauritsch, ...
ICML
2009
IEEE
16 years 7 months ago
Trajectory prediction: learning to map situations to robot trajectories
Trajectory planning and optimization is a fundamental problem in articulated robotics. Algorithms used typically for this problem compute optimal trajectories from scratch in a ne...
Nikolay Jetchev, Marc Toussaint
POPL
2009
ACM
16 years 7 months ago
Automated verification of practical garbage collectors
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
Chris Hawblitzel, Erez Petrank
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
16 years 6 months ago
The Price of Validity in Dynamic Networks
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with ...
Mayank Bawa, Aristides Gionis, Hector Garcia-Molin...
ICSE
2008
IEEE-ACM
16 years 6 months ago
PLURAL: checking protocol compliance under aliasing
Enforcing compliance to API usage protocols is notoriously hard due to possible aliasing of objects through multiple references. In previous work we proposed a sound, modular appr...
Kevin Bierhoff, Jonathan Aldrich