Sciweavers

1129 search results - page 50 / 226
» Finding Similar Failures Using Callstack Similarity
Sort
View
VLDB
2007
ACM
107views Database» more  VLDB 2007»
14 years 8 months ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
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 ...
Chen Li, Bin Wang, Xiaochun Yang
CVPR
2006
IEEE
14 years 10 months ago
Multi-Target Tracking - Linking Identities using Bayesian Network Inference
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...
Peter Nillius, Josephine Sullivan, Stefan Carlsson
GCB
2004
Springer
223views Biometrics» more  GCB 2004»
13 years 11 months ago
PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays
: 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, ...
Michael Beckstette, Dirk Strothmann, Robert Homann...
AMDO
2008
Springer
13 years 10 months ago
View-Invariant Human Action Detection Using Component-Wise HMM of Body Parts
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...
Bhaskar Chakraborty, Marco Pedersoli, Jordi Gonz&a...
ICCBR
2005
Springer
14 years 1 months ago
Selecting the Best Units in a Fleet: Performance Prediction from Equipment Peers
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...
Anil Varma, Kareem S. Aggour, Piero P. Bonissone