Sciweavers

580 search results - page 107 / 116
» On the memory complexity of the forward-backward algorithm
Sort
View
IMC
2010
ACM
13 years 5 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
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 8 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
PODS
2005
ACM
211views Database» more  PODS 2005»
14 years 7 months ago
Join-distinct aggregate estimation over update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
Sumit Ganguly, Minos N. Garofalakis, Amit Kumar, R...
PERCOM
2006
ACM
14 years 7 months ago
Adaptive Medical Feature Extraction for Resource Constrained Distributed Embedded Systems
Tiny embedded systems have not been an ideal outfit for high performance computing due to their constrained resources. Limitations in processing power, battery life, communication ...
Roozbeh Jafari, Hyduke Noshadi, Majid Sarrafzadeh,...
WABI
2009
Springer
132views Bioinformatics» more  WABI 2009»
14 years 2 months ago
mpscan: Fast Localisation of Multiple Reads in Genomes
Abstract. With Next Generation Sequencers, sequence based transcriptomic or epigenomic assays yield millions of short sequence reads that need to be mapped back on a reference geno...
Eric Rivals, Leena Salmela, Petteri Kiiskinen, Pet...