Sciweavers

338 search results - page 36 / 68
» Fast distributed random walks
Sort
View
BMCBI
2006
141views more  BMCBI 2006»
14 years 9 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
72
Voted
ICCV
2007
IEEE
15 years 11 months ago
Human Pose Estimation using Motion Exemplars
We present a motion exemplar approach for finding body configuration in monocular videos. A motion correlation technique is employed to measure the motion similarity at various sp...
Alireza Fathi, Greg Mori
71
Voted
KDD
1998
ACM
145views Data Mining» more  KDD 1998»
15 years 1 months ago
Coincidence Detection: A Fast Method for Discovering Higher-Order Correlations in Multidimensional Data
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
Evan W. Steeg, Derek A. Robinson, Ed Willis
CSB
2003
IEEE
15 years 3 months ago
Fast and Sensitive Probe Selection for DNA Chips Using Jumps in Matching Statistics
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
Sven Rahmann
ICDM
2010
IEEE
108views Data Mining» more  ICDM 2010»
14 years 7 months ago
Assessing Data Mining Results on Matrices with Randomization
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
Markus Ojala