نتایج جستجو برای: compactness of talks

تعداد نتایج: 21165306  

2013
Andrea Burgess Karen Meagher Bruce Reed

In 2009, Peter Cameron introduced a common generalization of various classes of combinatorial designs such as balanced incomplete block designs, resolvable designs and orthogonal arrays. Generalized covering and packing designs can be defined in analogous way. These objects bring into this framework further classes of designs, including covering and packing arrays, Howell designs, monogamous cy...

2006
David Steinsaltz Susan Holmes

Efforts to detect targets of recent positive selection (“selective sweeps”) in the genome frequently involve an initial screen of a region of the genome at a low density of markers (either SNPs or microsatellites), followed by a denser screen in the region flanking markers that show reduced or skewed variation relative to that predicted by an equilibrium neutral model or relative to “background...

2008
Ben Salah

This talk concerns Dirichlet and Neumann boundary value problems for second order elliptic divergence form equations with non-symmetric, or more general complex, and measurable coefficients independent of the transversal coordinate in the upper half space. I shall discuss some recent results obtained which shows that, in the case of non-symmetric coefficients, the solutions obtained with the bo...

2014
Peter Carr Squirrel Eiserloh Peter Ingebretson

In team sports, players move in complex but surprisingly predictable ways. With state-of-the-art computer vision and machine learning methods, it is now possible to collect sufficiently large player tracking datasets and learn patterns of how players actually move. In this talk, I will describe how this knowledge has been used at Disney Research to generate new analytics and sports broadcasting...

2014
Franz Baader Anthony G. Cohn Georg Gottlob Sheila A. McIlraith

Our understanding of the notion “dynamic system” is a rather broad one: such a system has states, which can change over time. Ontologies are used to describe the states of the system, possibly in an incomplete way. Monitoring is then concerned with deciding whether some run of the system or all of its runs satisfy a certain property, which can be expressed by a formula of an appropriate tempora...

Journal: :Electronic Notes in Theoretical Computer Science 2002

G. Jäger

We define and study a quantale-valued Wijsman structure on the hyperspace of all non-empty closed sets of a quantale-valued metric space. We show its admissibility and that the metrical coreflection coincides with the quantale-valued Hausdorff metric and that, for a metric space, the topological coreflection coincides with the classical Wijsman topology. We further define an index of compactnes...

2014
Michael Aizenman

s of Invited Talks Michael Aizenman Princeton University Kac-Ward propagator and graph zeta functions Roland Bauerschmidt University of Cambridge Delocalized eigenvectors for random regular graphs of fixed degree I will discuss results on the delocalization of eigenvectors and the spectral measure of random regular graphs with large but fixed degree. Our approach combines the almost determinist...

2005
Peter Benner

9:15 9:30 Opening 9:30 10:30 John A. Burns Sensitivity Analysis, Transition to Turbulence and Control 10:30 11:00 Coffee Break 11:00 12:00 Rainer Tichatschke Bregman-function-based regularization of variational inequalities with monotone operators 12:00 13:00 Lunch Break 13:00 14:00 Stefan Ulbrich Parallel All-at-Once methods with ”Parareal” time-domain decomposition for time-dependent PDE-cons...

2014
Hillel Furstenberg Jan Cannizzo Kavita Ramanan Rami Atar

S OF THE TALKS Hillel Furstenberg, Hebrew U. Qualitative Laws of Large Numbers. Abstract: If X1,X2, . . . ,Xn, . . . is an iid sequence of non-singular matrices, and we form the ”random product” Yn = X1 ∗ X2 ∗ X3 ∗ ⋯ ∗ Xn and let n → ∞ we find that the Yn tend to have a certain form. We analyze this phenomenon. If X1,X2, . . . ,Xn, . . . is an iid sequence of non-singular matrices, and we form ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید