Sciweavers

276 search results - page 28 / 56
» Fast Algorithm for Stochastic Tree Computation
Sort
View
TJS
2010
182views more  TJS 2010»
13 years 6 months ago
A novel unsupervised classification approach for network anomaly detection by k-Means clustering and ID3 decision tree learning
This paper presents a novel host-based combinatorial method based on k-Means clustering and ID3 decision tree learning algorithms for unsupervised classification of anomalous and ...
Yasser Yasami, Saadat Pour Mozaffari
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
13 years 11 months ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher
IPPS
2005
IEEE
14 years 1 months ago
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
Guojing Cong, David A. Bader
SDM
2011
SIAM
232views Data Mining» more  SDM 2011»
12 years 10 months ago
A Sequential Dual Method for Structural SVMs
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
Shirish Krishnaj Shevade, Balamurugan P., S. Sunda...
TASLP
2008
131views more  TASLP 2008»
13 years 7 months ago
A Noise-Robust FFT-Based Auditory Spectrum With Application in Audio Classification
In this paper, we investigate the noise robustness of Wang and Shamma's early auditory (EA) model for the calculation of an auditory spectrum in audio classification applicati...
Wei Chu, B. Champagne