Sciweavers

1414 search results - page 24 / 283
» Randomness and Universal Machines
Sort
View
CHI
2009
ACM
14 years 9 months ago
Can machines call people?: user experience while answering telephone calls initiated by machine
Current state-of?the-art spoken dialog systems are aimed at handling telephone calls to automate incoming caller requests. In this paper we explore a scenario which is symmetric t...
Adam J. Sporka, Jakub Franc, Giuseppe Riccardi
MLG
2007
Springer
14 years 2 months ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
TREC
2004
13 years 10 months ago
University of Glasgow at TREC 2004: Experiments in Web, Robust, and Terabyte Tracks with Terrier
With our participation in TREC2004, we test Terrier, a modular and scalable Information Retrieval framework, in three tracks. For the mixed query task of the Web track, we employ ...
Vassilis Plachouras, Ben He, Iadh Ounis

Lab
623views
14 years 7 months ago
Learning and Vision Research Group @ NUS
Wel­come to Learn­ing and Vi­sion Re­search Group at the De­part­ment of Elec­tri­cal and Com­put­er En­gi­neer­ing, Na­tion­al Uni­ver­si­ty of Sin­ga­pore!
COLT
2008
Springer
13 years 10 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal