Sciweavers

569 search results - page 6 / 114
» Online Bounds for Bayesian Algorithms
Sort
View
ESA
2010
Springer
152views Algorithms» more  ESA 2010»
14 years 11 months ago
Improved Bounds for Online Stochastic Matching
Bahman Bahmani, Michael Kapralov
SODA
1992
ACM
96views Algorithms» more  SODA 1992»
14 years 11 months ago
Lower Bounds for On-Line Graph Coloring
Magnús M. Halldórsson, Mario Szegedy
DCC
2010
IEEE
14 years 8 months ago
Neural Markovian Predictive Compression: An Algorithm for Online Lossless Data Compression
This work proposes a novel practical and general-purpose lossless compression algorithm named Neural Markovian Predictive Compression (NMPC), based on a novel combination of Bayesi...
Erez Shermer, Mireille Avigal, Dana Shapira
ICML
2006
IEEE
15 years 10 months ago
Learning algorithms for online principal-agent problems (and selling goods online)
In a principal-agent problem, a principal seeks to motivate an agent to take a certain action beneficial to the principal, while spending as little as possible on the reward. This...
Vincent Conitzer, Nikesh Garera
MFCS
2004
Springer
15 years 3 months ago
Online Algorithms for Disk Graphs
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
Ioannis Caragiannis, Aleksei V. Fishkin, Christos ...