Sciweavers

311 search results - page 59 / 63
» Evaluating Complex Semantic Artifacts
Sort
View
100
Voted
FSTTCS
2009
Springer
15 years 4 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
CVPR
2008
IEEE
15 years 11 months ago
A mobile vision system for robust multi-person tracking
We present a mobile vision system for multi-person tracking in busy environments. Specifically, the system integrates continuous visual odometry computation with tracking-bydetect...
Andreas Ess, Bastian Leibe, Konrad Schindler, Luc ...
SAC
2009
ACM
15 years 4 months ago
Points-to analysis for JavaScript
JavaScript is widely used by web developers and the complexity of JavaScript programs has increased over the last year. Therefore, the need for program analysis for JavaScript is ...
Dongseok Jang, Kwang-Moo Choe
88
Voted
CC
2009
Springer
106views System Software» more  CC 2009»
15 years 4 months ago
Blind Optimization for Exploiting Hardware Features
Software systems typically exploit only a small fraction of the realizable performance from the underlying microprocessors. While there has been much work on hardware-aware optimiz...
Dan Knights, Todd Mytkowicz, Peter F. Sweeney, Mic...
CSFW
2009
IEEE
15 years 4 months ago
Inputs of Coma: Static Detection of Denial-of-Service Vulnerabilities
—As networked systems grow in complexity, they are increasingly vulnerable to denial-of-service (DoS) attacks involving resource exhaustion. A single malicious input of coma can ...
Richard M. Chang, Guofei Jiang, Franjo Ivancic, Sr...