Sciweavers

255 search results - page 48 / 51
» Inferring design patterns using the ReP graph
Sort
View
ICFP
2006
ACM
16 years 8 days ago
Extensible programming with first-class cases
We present language mechanisms for polymorphic, extensible records and their exact dual, polymorphic sums with extensible first-class cases. These features make it possible to eas...
Matthias Blume, Umut A. Acar, Wonseok Chae
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 4 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
AIRWEB
2007
Springer
15 years 4 months ago
Measuring Similarity to Detect Qualified Links
The early success of link-based ranking algorithms was predicated on the assumption that links imply merit of the target pages. However, today many links exist for purposes other ...
Xiaoguang Qi, Lan Nie, Brian D. Davison
SIGIR
2008
ACM
15 years 7 days ago
Classifiers without borders: incorporating fielded text from neighboring web pages
Accurate web page classification often depends crucially on information gained from neighboring pages in the local web graph. Prior work has exploited the class labels of nearby p...
Xiaoguang Qi, Brian D. Davison
UAI
2007
15 years 1 months ago
"I Can Name that Bayesian Network in Two Matrixes!"
The traditional approach to building Bayesian networks is to build the graphical structure using a graphical editor and then add probabilities using a separate spreadsheet for eac...
Russell Almond