Sciweavers

24680 search results - page 4817 / 4936
» Learning
Sort
View
NIPS
2003
13 years 10 months ago
A Classification-based Cocktail-party Processor
At a cocktail party, a listener can selectively attend to a single voice and filter out other acoustical interferences. How to simulate this perceptual ability remains a great cha...
Nicoleta Roman, DeLiang L. Wang, Guy J. Brown
NIPS
2003
13 years 10 months ago
Max-Margin Markov Networks
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...
Benjamin Taskar, Carlos Guestrin, Daphne Koller
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 10 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
AAAI
1998
13 years 10 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
AAAI
2000
13 years 10 months ago
Decision Making under Uncertainty: Operations Research Meets AI (Again)
Models for sequential decision making under uncertainty (e.g., Markov decision processes,or MDPs) have beenstudied in operations research for decades. The recent incorporation of ...
Craig Boutilier
« Prev « First page 4817 / 4936 Last » Next »