Sciweavers

1129 search results - page 4 / 226
» Finding Similar Failures Using Callstack Similarity
Sort
View
INFOCOM
2007
IEEE
14 years 2 days ago
Finding Self-Similarities in Opportunistic People Networks
— Opportunistic network is a type of Delay Tolerant Networks (DTN) where network communication opportunities appear opportunistic. In this study, we investigate opportunistic net...
Ling-Jyh Chen, Yung-Chih Chen, Tony Sun, Paruvelli...
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
13 years 11 months ago
Finding Top-k Similar Pairs of Objects Annotated with Terms from an Ontology
With the growing focus on semantic searches and interpretations, an increasing number of standardized vocabularies and ontologies are being designed and used to describe data. We ...
Arnab Bhattacharya, Abhishek Bhowmick, Ambuj K. Si...
ECCV
2008
Springer
14 years 7 months ago
What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of neares...
Neeraj Kumar, Li Zhang, Shree K. Nayar
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
13 years 3 months ago
On Finding Similar Items in a Stream of Transactions
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
Andrea Campagna, Rasmus Pagh
ICDE
2000
IEEE
96views Database» more  ICDE 2000»
14 years 7 months ago
Dynamic Miss-Counting Algorithms: Finding Implication and Similarity Rules with Confidence Pruning
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
Shinji Fujiwara, Jeffrey D. Ullman, Rajeev Motwani