Sciweavers

138 search results - page 26 / 28
» Dynamic Slicing of Aspect-Oriented Programs
Sort
View
NIPS
2008
13 years 9 months ago
The Infinite Factorial Hidden Markov Model
We introduce a new probability distribution over a potentially infinite number of binary Markov chains which we call the Markov Indian buffet process. This process extends the IBP...
Jurgen Van Gael, Yee Whye Teh, Zoubin Ghahramani
MICCAI
2002
Springer
14 years 8 months ago
Intra-patient Prone to Supine Colon Registration for Synchronized Virtual Colonoscopy
Abstract. In this paper, we present an automated method for colon registration. The method uses dynamic programming to align data defined on colon center-line paths, as extracted f...
Delphine Nain, Steven Haker, W. Eric L. Grimson, E...
ASPLOS
2008
ACM
13 years 9 months ago
Dispersing proprietary applications as benchmarks through code mutation
Industry vendors hesitate to disseminate proprietary applications to academia and third party vendors. By consequence, the benchmarking process is typically driven by standardized...
Luk Van Ertvelde, Lieven Eeckhout
SOSP
2007
ACM
14 years 4 months ago
Bouncer: securing software by blocking bad input
Attackers exploit software vulnerabilities to control or crash programs. Bouncer uses existing software instrumentation techniques to detect attacks and it generates filters auto...
Manuel Costa, Miguel Castro, Lidong Zhou, Lintao Z...
IFL
2004
Springer
122views Formal Methods» more  IFL 2004»
14 years 1 months ago
Source-Based Trace Exploration
Abstract. Tracing a computation is a key method for program comprehension and debugging. Hat is a tracing system for Haskell 98 programs. During a computation a trace is recorded i...
Olaf Chitil