874 search results - page 150 / 175 » Faster Algorithms for Semi-Matching Problems |
ISSTA
2012
ACM
11 years 11 months ago
2012
ACM
We introduce a static detector, Saber, for detecting memory leaks in C programs. Leveraging recent advances on sparse pointer analysis, Saber is the first to use a full-sparse va...
ICSE
2012
IEEE-ACM
11 years 11 months ago
2012
IEEE-ACM
—Integrated Development Environments (IDEs) have come to perform a wide variety of tasks on behalf of the programmer, refactoring being a classic example. These operations have u...
ICCV
2007
IEEE
14 years 10 months ago
2007
IEEE
We extend the "Sparse LDA" algorithm of [7] with new sparsity bounds on 2-class separability and efficient partitioned matrix inverse techniques leading to 1000-fold spe...
DAC
2006
ACM
14 years 9 months ago
2006
ACM
Steiner routing is a fundamental yet NP-hard problem in VLSI design and other research fields. In this paper, we propose to model the routing graph by an RC network with routing t...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
We propose an approach to speeding up object detection, with an emphasis on settings where multiple object classes are being detected. Our method uses a segmentation algorithm to ...