367 search results - page 36 / 74 » Tight lower bounds for the online labeling problem |
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...
ALT
2009
Springer
14 years 4 months ago
2009
Springer
We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M u...
ICAART
2010
INSTICC
14 years 4 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
IWDC
2005
Springer
14 years 1 months ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
COMPGEOM
2010
ACM
14 years 20 days ago
2010
ACM
We present new bounds on the first selection lemma in R3 . This makes progress on the open problems of Bukh, Matoušek and Nivash [6] and Boros-Füredi [4] for the three-dimensio...