๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Adaptive Version of the Boost by Majority Algorithm

โœ Scribed by Yoav Freund

Book ID
110295275
Publisher
Springer
Year
2001
Tongue
English
Weight
130 KB
Volume
43
Category
Article
ISSN
0885-6125

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Adaptive Version of the Immersed Boun
An Adaptive Version of the Immersed Boundary Method
โœ Alexandre M Roma; Charles S Peskin; Marsha J Berger ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 244 KB

A computational setting for the Immersed Boundary Method employing an adaptive mesh refinement is presented. Enhanced accuracy for the method is attained locally by covering an immersed boundary vicinity with a sequence of nested, progressively finer rectangular grid patches which dynamically follow

An algorithmic version of the blow-up le
An algorithmic version of the blow-up lemma
โœ Jรกnos Komlรณs; Gabor N. Sarkozy; Endre Szemerรฉdi ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 210 KB ๐Ÿ‘ 1 views

Recently we developed a new method in graph theory based on the regularity lemma. The method is applied to find certain spanning subgraphs in dense graphs. The other main general tool of the method, besides the regularity lemma, is the so-called blow-up ลฝ w ลฝ .x lemma Komlos, Sarkozy, and Szemeredi