Sciweavers

620 search results - page 122 / 124
» Likelihood Computations Using Value Abstraction
Sort
View
ISSTA
2009
ACM
14 years 4 months ago
Exception analysis and points-to analysis: better together
Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch stateme...
Martin Bravenboer, Yannis Smaragdakis
CISS
2008
IEEE
14 years 4 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
CPAIOR
2007
Springer
14 years 4 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
ICIAR
2005
Springer
14 years 3 months ago
Real-Time and Robust Background Updating for Video Surveillance and Monitoring
Abstract. Background updating is an important aspect of dynamic scene analysis. Two critical problems: sudden camera perturbation and the sleeping person problem, which arise frequ...
Xingzhi Luo, Suchendra M. Bhandarkar
AFP
2004
Springer
105views Formal Methods» more  AFP 2004»
14 years 3 months ago
Epigram: Practical Programming with Dependent Types
Abstraction and application, tupling and projection: these provide the ‘software engineering’ superstructure for programs, and our familiar type systems ensure that these opera...
Conor McBride