Sciweavers

4007 search results - page 326 / 802
» Computation with imprecise probabilities
Sort
View
203
Voted
ISBI
2006
IEEE
16 years 8 months ago
Continuous image representations avoid the histogram binning problem in mutual information based image registration
Mutual information (MI) based image-registration methods that use histograms are known to suffer from the so-called binning problem, caused by the absence of a principled techniqu...
Ajit Rajwade, Arunava Banerjee, Anand Rangarajan
CAV
2009
Springer
135views Hardware» more  CAV 2009»
16 years 8 months ago
Sliding Window Abstraction for Infinite Markov Chains
Window Abstraction for Infinite Markov Chains Thomas A. Henzinger1 , Maria Mateescu1 , and Verena Wolf1,2 1 EPFL, Switzerland 2 Saarland University, Germany Abstract. We present an...
Thomas A. Henzinger, Maria Mateescu, Verena Wolf
193
Voted
KDD
2009
ACM
193views Data Mining» more  KDD 2009»
16 years 8 months ago
Probabilistic frequent itemset mining in uncertain databases
Probabilistic frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied to standard "certain&quo...
Andreas Züfle, Florian Verhein, Hans-Peter Kr...
198
Voted
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
16 years 8 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
177
Voted
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
16 years 8 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church