Sciweavers

2424 search results - page 74 / 485
» A general algorithm for data dependence analysis
Sort
View
SAS
1999
Springer
15 years 7 months ago
Eliminating Dead Code on Recursive Data
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
Yanhong A. Liu, Scott D. Stoller
JMLR
2006
99views more  JMLR 2006»
15 years 3 months ago
Worst-Case Analysis of Selective Sampling for Linear Classification
A selective sampling algorithm is a learning algorithm for classification that, based on the past observed data, decides whether to ask the label of each new instance to be classi...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
INFORMATICASI
2010
15 years 9 days ago
Strategic Modeling of Information Sharing among Data Privacy Attackers
Research in privacy-preserving data publishing has revealed the necessity of accounting for an adversary's background knowledge when reasoning about the protection afforded b...
Quang Duong, Kristen LeFevre, Michael P. Wellman
SIGSOFT
2004
ACM
15 years 8 months ago
Resolving uncertainties during trace analysis
Software models provide independent perspectives onto software systems. Ideally, all models should use the same model element to describe the same part of a system. Practically, m...
Alexander Egyed
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
15 years 4 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov