Sciweavers

429 search results - page 73 / 86
» Noisy Turing Machines
Sort
View
ICML
2003
IEEE
14 years 8 months ago
Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries
Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of ...
Jeremy Kubica, Andrew W. Moore, David Cohn, Jeff G...
ICML
2003
IEEE
14 years 8 months ago
Learning with Positive and Unlabeled Examples Using Weighted Logistic Regression
The problem of learning with positive and unlabeled examples arises frequently in retrieval applications. We transform the problem into a problem of learning with noise by labelin...
Wee Sun Lee, Bing Liu
ICML
2001
IEEE
14 years 8 months ago
Direct Policy Search using Paired Statistical Tests
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...
Malcolm J. A. Strens, Andrew W. Moore
ICML
1998
IEEE
14 years 8 months ago
Value Function Based Production Scheduling
Production scheduling, the problem of sequentially con guring a factory to meet forecasted demands, is a critical problem throughout the manufacturing industry. The requirement of...
Jeff G. Schneider, Justin A. Boyan, Andrew W. Moor...
ACML
2009
Springer
14 years 2 months ago
Coupled Metric Learning for Face Recognition with Degraded Images
Real-world face recognition systems are sometimes confronted with degraded face images, e.g., low-resolution, blurred, and noisy ones. Traditional two-step methods have limited per...
Bo Li, Hong Chang, Shiguang Shan, Xilin Chen