Sciweavers

4816 search results - page 159 / 964
» Performance analysis of the AntNet algorithm
Sort
View
SIGSOFT
2004
ACM
16 years 6 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
PODS
2006
ACM
122views Database» more  PODS 2006»
16 years 6 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
ISBRA
2007
Springer
16 years 9 days ago
Clustering Algorithms Optimizer: A Framework for Large Datasets
Clustering algorithms are employed in many bioinformatics tasks, including categorization of protein sequences and analysis of gene-expression data. Although these algorithms are r...
Roy Varshavsky, David Horn, Michal Linial
WABI
2005
Springer
143views Bioinformatics» more  WABI 2005»
15 years 11 months ago
A Faster Algorithm for Detecting Network Motifs
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
Sebastian Wernicke
CASES
2003
ACM
15 years 11 months ago
Polynomial-time algorithm for on-chip scratchpad memory partitioning
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
Federico Angiolini, Luca Benini, Alberto Caprara