Sciweavers

492 search results - page 92 / 99
» Fast data stream algorithms using associative memories
Sort
View
PODS
2009
ACM
130views Database» more  PODS 2009»
15 years 10 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
15 years 10 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
IMC
2010
ACM
14 years 7 months ago
Revisiting the case for a minimalist approach for network flow monitoring
Network management applications require accurate estimates of a wide range of flow-level traffic metrics. Given the inadequacy of current packet-sampling-based solutions, several ...
Vyas Sekar, Michael K. Reiter, Hui Zhang
ICASSP
2011
IEEE
14 years 1 months ago
Online Kernel SVM for real-time fMRI brain state prediction
The Support Vector Machine (SVM) methodology is an effective, supervised, machine learning method that gives stateof-the-art performance for brain state classification from funct...
Yongxin Taylor Xi, Hao Xu, Ray Lee, Peter J. Ramad...
BMCBI
2010
198views more  BMCBI 2010»
14 years 9 months ago
ClustalXeed: a GUI-based grid computation version for high performance and terabyte size multiple sequence alignment
Background: There is an increasing demand to assemble and align large-scale biological sequence data sets. The commonly used multiple sequence alignment programs are still limited...
Taeho Kim, Hyun Joo