1129 search results - page 50 / 226 » Finding Similar Failures Using Callstack Similarity |
305
click to vote
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
193
Voted
CVPR
2006
IEEE
16 years 9 months ago
2006
IEEE
Multi-target tracking requires locating the targets and labeling their identities. The latter is a challenge when many targets, with indistinct appearances, frequently occlude one...
226
Voted
GCB
2004
Springer
15 years 11 months ago
2004
Springer
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
240
Voted
AMDO
2008
Springer
15 years 9 months ago
2008
Springer
This paper presents a framework for view-invariant action recognition in image sequences. Feature-based human detection becomes extremely challenging when the agent is being observ...
196
Voted
ICCBR
2005
Springer
16 years 28 days ago
2005
Springer
We focus on the problem of selecting the few vehicles in a fleet that are expected to last the longest without failure. The prediction of each vehicle’s remaining life is based o...