Sciweavers

139 search results - page 10 / 28
» Fast perfect sampling from linear extensions
Sort
View
FCCM
2002
IEEE
127views VLSI» more  FCCM 2002»
14 years 26 days ago
Hardware-Assisted Fast Routing
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
André DeHon, Randy Huang, John Wawrzynek
CEAS
2007
Springer
13 years 12 months ago
Online Active Learning Methods for Fast Label-Efficient Spam Filtering
Active learning methods seek to reduce the number of labeled examples needed to train an effective classifier, and have natural appeal in spam filtering applications where trustwo...
D. Sculley
TNN
2008
105views more  TNN 2008»
13 years 7 months ago
Generalized Linear Discriminant Analysis: A Unified Framework and Efficient Model Selection
Abstract--High-dimensional data are common in many domains, and dimensionality reduction is the key to cope with the curse-of-dimensionality. Linear discriminant analysis (LDA) is ...
Shuiwang Ji, Jieping Ye
CVPR
2010
IEEE
14 years 1 months ago
Visual Tracking via Weakly Supervised Learning from Multiple Imperfect Oracles
Long-term persistent tracking in ever-changing environments is a challenging task, which often requires addressing difficult object appearance update problems. To solve them, most...
Bineng Zhong, Hongxun Yao, Sheng Chen, Xiaotong Yu...
CLASSIFICATION
2004
59views more  CLASSIFICATION 2004»
13 years 7 months ago
Oscillation Heuristics for the Two-group Classification Problem
: We propose a new nonparametric family of oscillation heuristics for improving linear classifiers in the two-group discriminant problem. The heuristics are motivated by the intuit...
Ognian Asparouhov, Paul A. Rubin