1129 search results - page 170 / 226 » Finding Similar Failures Using Callstack Similarity |
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
We propose a method based on sparse representation
(SR) to cluster data drawn from multiple low-dimensional
linear or affine subspaces embedded in a high-dimensional
space. Our ...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely ...
CSCW
2006
ACM
14 years 2 months ago
2006
ACM
An emergent class of web applications blurs the boundary between single user application and online public space. Recently popular web applications like del.icio.us help manage in...
ICNC
2005
Springer
14 years 1 months ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
CAV
2006
Springer
14 years 2 days ago
2006
Springer
Abstract. The problem of finding a small unsatisfiable core of an unsatisfiable CNF formula is addressed. The proposed algorithm, Trimmer, iterates over each internal node d in the...