Sciweavers

994 search results - page 193 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
DAC
2003
ACM
14 years 7 months ago
Automated synthesis of efficient binary decoders for retargetable software toolkits
A binary decoder is a common component of software development tools such as instruction set simulators, disassemblers and debuggers. The efficiency of the decoder can have a sign...
Wei Qin, Sharad Malik
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 7 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
VLDB
2008
ACM
170views Database» more  VLDB 2008»
14 years 7 months ago
A multi-ranker model for adaptive XML searching
The evolution of computing technology suggests that it has become more feasible to offer access to Web information in a ubiquitous way, through various kinds of interaction device...
Ho Lam Lau, Wilfred Ng
MSR
2006
ACM
14 years 20 days ago
Predicting defect densities in source code files with decision tree learners
With the advent of open source software repositories the data available for defect prediction in source files increased tremendously. Although traditional statistics turned out t...
Patrick Knab, Martin Pinzger, Abraham Bernstein
ROCAI
2004
Springer
14 years 1 days ago
Learning Mixtures of Localized Rules by Maximizing the Area Under the ROC Curve
We introduce a model class for statistical learning which is based on mixtures of propositional rules. In our mixture model, the weight of a rule is not uniform over the entire ins...
Tobias Sing, Niko Beerenwinkel, Thomas Lengauer