Titlebook: Algorithms - ESA 2010; 18th Annual European Mark Berg,Ulrich Meyer Conference proceedings 2010 Springer-Verlag Berlin Heidelberg 2010 CSP.H

发现

Superselectors: Efficient Constructions and Applicationsrs to solve problems in group testing, compressed sensing, multi-channel conflict resolution and data security. We prove close upper and lower bounds on the size of superselectors and we provide efficient algorithms for their constructions. Albeit our bounds are very general, when they are instantia

头盔

Estimating the Average of a Lipschitz-Continuous Function from One Sample More specifically, we explore the role of randomness in drawing this sample. Our goal is to find a distribution minimizing the expected estimation error against an adversarially chosen Lipschitz continuous function. Our work falls into the broad class of estimating aggregate statistics of a functio

Tracheotomy

小歌剧

Contribution Games in Social Networksral conditions. A special focus of the paper are minimum effort games, where the success of a project depends only on the minimum effort of any of the participants. Finally, we briefly discuss additional aspects like approximate equilibria and convergence of dynamics.

土坯

Susanne Klein-Vogelbach,Irene Spirgi-Gantertal of . is an embedded topological minor of the dual of .. We show how to reduce finding embedded topological minors in plane graphs to solving an instance of the disjoint paths problem. Finally, we extend the result to graphs embeddable in an arbitrary surface.

蚀刻术

TERRA

Type-1-Diabetes

escalate

贪婪地吃