Sciweavers

590 search results - page 95 / 118
» Can We Learn to Beat the Best Stock
Sort
View
NIPS
2008
14 years 11 months ago
Automatic online tuning for fast Gaussian summation
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
Vlad I. Morariu, Balaji Vasan Srinivasan, Vikas C....
89
Voted
AIPS
2011
14 years 1 months ago
Planning and Acting in Incomplete Domains
Engineering complete planning domain descriptions is often very costly because of human error or lack of domain knowledge. Learning complete domain descriptions is also very chall...
Christopher Weber, Daniel Bryce
SIGIR
2011
ACM
14 years 15 days ago
Fast context-aware recommendations with factorization machines
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
Steffen Rendle, Zeno Gantner, Christoph Freudentha...
NLDB
2005
Springer
15 years 3 months ago
Combining Data-Driven Systems for Improving Named Entity Recognition
Abstract. The increasing flow of digital information requires the extraction, filtering and classification of pertinent information from large volumes of texts. An important pre...
Zornitsa Kozareva, Óscar Ferrández, ...
ICCV
2007
IEEE
15 years 11 months ago
Discriminative Subsequence Mining for Action Classification
Recent approaches to action classification in videos have used sparse spatio-temporal words encoding local appearance around interesting movements. Most of these approaches use a ...
Sebastian Nowozin, Gökhan H. Bakir, Koji Tsud...