360 search results - page 46 / 72 » Explanations and Proof Trees |
APAL
2006
13 years 10 months ago
2006
We give a short proof of a lemma which generalizes both the main lemma from the original construction in the author's thesis of a model with no 2-Aronszajn trees, and also th...
JCSS
2006
13 years 10 months ago
2006
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
Book
"This book has evolved from materials used in an undergraduate course intended for final year undergraduate students whose background includes at least one year's experie...
ICDE
2008
IEEE
14 years 11 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
ICML
2000
IEEE
14 years 10 months ago
2000
IEEE
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...