Sciweavers

4536 search results - page 637 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
AAAI
2008
15 years 9 months ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han
132
Voted
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
15 years 8 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
15 years 8 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
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
16 years 7 months ago
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
Andreas Krause, Carlos Guestrin, Christos Faloutso...
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
16 years 3 months ago
Exact Discovery of Time Series Motifs.
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
Abdullah Mueen, Eamonn J. Keogh, M. Brandon Westov...