Sciweavers

241 search results - page 42 / 49
» Estimating statistical aggregates on probabilistic data stre...
Sort
View
ML
2010
ACM
142views Machine Learning» more  ML 2010»
14 years 8 months ago
Fast adaptive algorithms for abrupt change detection
We propose two fast algorithms for abrupt change detection in streaming data that can operate on arbitrary unknown data distributions before and after the change. The first algor...
Daniel Nikovski, Ankur Jain
76
Voted
SIGIR
2009
ACM
15 years 4 months ago
On rank correlation and the distance between rankings
Rank correlation statistics are useful for determining whether a there is a correspondence between two measurements, particularly when the measures themselves are of less interest...
Ben Carterette
NIPS
2003
14 years 11 months ago
Human and Ideal Observers for Detecting Image Curves
This paper compares the ability of human observers to detect target image curves with that of an ideal observer. The target curves are sampled from a generative model which speci...
Alan L. Yuille, Fang Fang, Paul R. Schrater, Danie...
102
Voted
MICRO
2002
IEEE
164views Hardware» more  MICRO 2002»
15 years 2 months ago
A quantitative framework for automated pre-execution thread selection
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated fr...
Amir Roth, Gurindar S. Sohi
84
Voted
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
14 years 11 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens