Sciweavers

1060 search results - page 127 / 212
» On the Discovery of Random Trees
Sort
View
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
16 years 6 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
JCC
2008
99views more  JCC 2008»
15 years 4 months ago
Assessment of programs for ligand binding affinity prediction
: The prediction of the binding free energy between a ligand and a protein is an important component in the virtual screening and lead optimization of ligands for drug discovery. T...
Ryangguk Kim, Jeffrey Skolnick
BMCBI
2006
156views more  BMCBI 2006»
15 years 6 months ago
GOFFA: Gene Ontology For Functional Analysis - A FDA Gene Ontology Tool for Analysis of Genomic and Proteomic Data
Background: Gene Ontology (GO) characterizes and categorizes the functions of genes and their products according to biological processes, molecular functions and cellular componen...
Hongmei Sun, Hong Fang, Tao Chen, Roger Perkins, W...
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
15 years 10 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
ADMA
2006
Springer
110views Data Mining» more  ADMA 2006»
15 years 10 months ago
Learning with Local Drift Detection
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Gladys Castillo