Sciweavers

561 search results - page 30 / 113
» An empirical analysis of the FixCache algorithm
Sort
View
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
14 years 8 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
AIEDU
2010
13 years 5 months ago
Supporting Collaborative Learning and E-Discussions Using Artificial Intelligence Techniques
An emerging trend in classrooms is the use of networked visual argumentation tools that allow students to discuss, debate, and argue with one another in a synchronous fashion about...
Bruce M. McLaren, Oliver Scheuer, Jan Miksatko
BMCBI
2007
86views more  BMCBI 2007»
13 years 7 months ago
Detecting microsatellites within genomes: significant variation among algorithms
Background: Microsatellites are short, tandemly-repeated DNA sequences which are widely distributed among genomes. Their structure, role and evolution can be analyzed based on exh...
Sébastien Leclercq, Eric Rivals, Philippe J...
ICDM
2009
IEEE
162views Data Mining» more  ICDM 2009»
14 years 2 months ago
Accurate Estimation of the Degree Distribution of Private Networks
—We describe an efficient algorithm for releasing a provably private estimate of the degree distribution of a network. The algorithm satisfies a rigorous property of differenti...
Michael Hay, Chao Li, Gerome Miklau, David Jensen
SYNTHESE
2008
84views more  SYNTHESE 2008»
13 years 7 months ago
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
Thomas Bartz-Beielstein