Sciweavers

12257 search results - page 129 / 2452
» Analysis of Algorithms
Sort
View
ICMLA
2008
13 years 11 months ago
Predicting Algorithm Accuracy with a Small Set of Effective Meta-Features
We revisit 26 meta-features typically used in the context of meta-learning for model selection. Using visual analysis and computational complexity considerations, we find 4 meta-f...
Jun Won Lee, Christophe G. Giraud-Carrier
CC
2006
Springer
108views System Software» more  CC 2006»
14 years 1 months ago
Efficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers
This paper presents a new worklist algorithm that significantly speeds up a large class of flow-sensitive data-flow analyses, including typestate error checking and pointer analysi...
Teck Bok Tok, Samuel Z. Guyer, Calvin Lin
JCST
2010
189views more  JCST 2010»
13 years 4 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
FGCN
2008
IEEE
111views Communications» more  FGCN 2008»
14 years 4 months ago
Towards an Estimation of the Accuracy of TCP Reassembly in Network Forensics
Today, honeypot operators are strongly relying on network analysis tools to examine network traces collected in their honeynet environment. The accuracy of such analysis depends o...
Gérard Wagener, Alexandre Dulaunoy, Thomas ...
ICIAR
2007
Springer
13 years 11 months ago
A Simple Oriented Mean-Shift Algorithm for Tracking
Mean-Shift tracking gained a lot of popularity in computer vision community. This is due to its simplicity and robustness. However, the original formulation does not estimate the o...
Jamil Draréni, Sébastien Roy