Sciweavers

557 search results - page 70 / 112
» Learning programs from noisy data
Sort
View
129
Voted
CORR
2012
Springer
204views Education» more  CORR 2012»
13 years 10 months ago
A Framework for Optimizing Paper Matching
At the heart of many scientific conferences is the problem of matching submitted papers to suitable reviewers. Arriving at a good assignment is a major and important challenge fo...
Laurent Charlin, Richard S. Zemel, Craig Boutilier
201
Voted
ECOOP
2011
Springer
14 years 2 months ago
Frequency Estimation of Virtual Call Targets for Object-Oriented Programs
Abstract. The information of execution frequencies of virtual call targets is valuable for program analyses and optimizations of object-oriented programs. However, to obtain this i...
Cheng Zhang, Hao Xu, Sai Zhang, Jianjun Zhao, Yuti...
131
Voted
CVPR
2010
IEEE
15 years 10 months ago
Naming People from Dialog: Temporal Grouping and Weak Supervision
We address the character identification problem in movies and television videos: assigning names to faces on the screen. Most prior work on person recognition in video assumes s...
Timothee Cour, Benjamin Sapp, Akash Nagle, Ben Tas...
122
Voted
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
16 years 3 months ago
Learning subspace kernels for classification
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
Jianhui Chen, Shuiwang Ji, Betul Ceran, Qi Li, Min...
135
Voted
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 3 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen