Sciweavers

5329 search results - page 171 / 1066
» The Weighted Majority Algorithm
Sort
View
127
Voted
UAI
2001
15 years 4 months ago
Maximum Likelihood Bounded Tree-Width Markov Networks
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
Nathan Srebro
127
Voted
CORR
2012
Springer
210views Education» more  CORR 2012»
13 years 10 months ago
Towards minimax policies for online linear optimization with bandit feedback
We address the online linear optimization problem with bandit feedback. Our contribution is twofold. First, we provide an algorithm (based on exponential weights) with a regret of...
Sébastien Bubeck, Nicolò Cesa-Bianch...
IDMS
1998
Springer
76views Multimedia» more  IDMS 1998»
15 years 6 months ago
Exploiting User Behaviour in Prefetching WWW Documents
As the popularity of the World Wide Web increases, the amount of traffic results in major congestion problems for the retrieval of data over wide distances. To react to this, user...
Abdulmotaleb El-Saddik, Carsten Griwodz, Ralf Stei...
136
Voted
COMCOM
2000
85views more  COMCOM 2000»
15 years 2 months ago
Interactive Distributed Multimedia Systems and Telecommunication Services
As the popularity of the World Wide Web increases, the amount of traffic results in major congestion problems for the retrieval of data over wide distances. To react to this, user...
CVPR
2003
IEEE
16 years 4 months ago
Many-to-Many Graph Matching via Metric Embedding
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
Yakov Keselman, Ali Shokoufandeh, M. Fatih Demirci...