Sciweavers

1716 search results - page 301 / 344
» Proving Conditional Termination
Sort
View
130
Voted
FASE
2011
Springer
14 years 4 months ago
Theoretical Aspects of Compositional Symbolic Execution
Given a program and an assertion in that program, determining if the assertion can fail is one of the key applications of program analysis. Symbolic execution is a well-known techn...
Dries Vanoverberghe, Frank Piessens
118
Voted
RTS
2011
176views more  RTS 2011»
14 years 3 months ago
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
This paper is an extended version of a paper that appeared in the proceedings of the IEEE Real-Time Systems Symposium 2009. This paper has been updated with respect to advances ma...
Robert I. Davis, Alan Burns
JMLR
2012
13 years 3 months ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski
168
Voted
CVPR
2012
IEEE
13 years 3 months ago
Fixed-rank representation for unsupervised visual learning
Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-theart technique...
Risheng Liu, Zhouchen Lin, Fernando De la Torre, Z...
97
Voted
AAAI
2012
13 years 3 months ago
On Maxsum Fair Cake Divisions
We consider the problem of selecting fair divisions of a heterogeneous divisible good among a set of agents. Recent work (Cohler et al., AAAI 2011) focused on designing algorithms...
Steven J. Brams, Michal Feldman, John K. Lai, Jami...