Results 1  10
of
78
An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition
, 1997
"... This document has been prepared using the L a T E X system. We thank Donald Knuth for T E X, Leslie Lamport for L a T E X, and Jan van der Steen at CWI for online help. Some figures were prepared by John Tromp using the xpic program. The London Mathematical Society kindly gave permission to reproduc ..."
Abstract

Cited by 2143 (120 self)
 Add to MetaCart
This document has been prepared using the L a T E X system. We thank Donald Knuth for T E X, Leslie Lamport for L a T E X, and Jan van der Steen at CWI for online help. Some figures were prepared by John Tromp using the xpic program. The London Mathematical Society kindly gave permission
The CasselsTate Pairing On Polarized Abelian Varieties
 Ann. of Math
, 1998
"... . Let (A; ) be a principally polarized abelian variety dened over a global eld k, and let X(A) be its Shafarevich{Tate group. Let X(A) nd denote the quotient of X(A) by its maximal divisible subgroup. Cassels and Tate constructed a nondegenerate pairing X(A) nd X(A) nd ! Q=Z : If A is an ellip ..."
Abstract

Cited by 69 (16 self)
 Add to MetaCart
. Let (A; ) be a principally polarized abelian variety dened over a global eld k, and let X(A) be its Shafarevich{Tate group. Let X(A) nd denote the quotient of X(A) by its maximal divisible subgroup. Cassels and Tate constructed a nondegenerate pairing X(A) nd X(A) nd ! Q=Z : If A is an elliptic curve, then by a result of Cassels' the pairing is alternating. But in general it is only antisymmetric. Using some new but equivalent denitions of the pairing, we derive general criteria deciding whether it is alternating and whether there exists some alternating nondegenerate pairing on X(A) nd . These criteria are expressed in terms of an element c 2 X(A) nd that is canonically associated to the polarization . In the case that A is the Jacobian of some curve, a downtoearth version of the result allows us to determine eectively whether #X(A) (if nite) is a square or twice a square. We then apply this to prove that a positive proportion (in some precise sense) of all hyperell...
The Construction of MetaTools for Program Visualization of Parallel Software
, 1992
"... Program visualization has been successfully applied to alleviate the complexities of parallel software development. However, those program visualization tools which utilize the more advanced visualization techniques tend to be too complex and specialpurpose to be generally useful. The use of met ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Program visualization has been successfully applied to alleviate the complexities of parallel software development. However, those program visualization tools which utilize the more advanced visualization techniques tend to be too complex and specialpurpose to be generally useful. The use
Accelerated dual decomposition for MAP inference
 In ICML
, 2010
"... Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language understanding. Current stateoftheart approaches employ convex relaxations of these problems as surrogate objectives, but ..."
Abstract

Cited by 36 (1 self)
 Add to MetaCart
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language understanding. Current stateoftheart approaches employ convex relaxations of these problems as surrogate objectives, but only provide weak running time guarantees. In this paper, we develop an approximate inference algorithm that is both efficient and has strong theoretical guarantees. Specifically, our algorithm is guaranteed to converge to an accurate solution of the convex relaxation in O
Planning Robust Temporal Plans A Comparison Between CBTP and TGA Approaches
, 2007
"... Planning for real world applications, with explicit temporal representation and a robust execution is a very challenging problem. To tackle it, the planning community has proposed a number of original and successful approaches. However, there are other paradigms “outside” the Automated Planning fiel ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Planning for real world applications, with explicit temporal representation and a robust execution is a very challenging problem. To tackle it, the planning community has proposed a number of original and successful approaches. However, there are other paradigms “outside” the Automated Planning field which may prove to be successful with respect to this objective. This paper presents a comparison of two “planning” approaches dealing with temporal and/or discrete uncertainties and with a strong emphasis on robust execution. The first approach is based on chronicles and constraint satisfaction techniques; it relies on a causal link partial order temporal planner, in our case I XTET. The second approach is based on timed game automata and reachability analysis, and uses the UPPAALTIGA system. The comparison is both qualitative (the kind of problems modeled and the properties of plans obtained) and quantitative (experimental results on a real example). To make this comparison possible, we propose a general scheme to translate a subset of I XTET planning problems into UPPAALTIGA gamereachability problems. A direct consequence of this automated process would be the possibility to apply validation and verification techniques available in the timed automata community.
Geometric Waldspurger periods
"... Abstract Let X be a smooth projective curve. We consider the dual reductive pair H = GO 2m, G = GSp 2n over X, where H splits on an étale twosheeted covering π: ˜X → X. Let BunG (resp., BunH) be the stack of Gtorsors (resp., Htorsors) on X. We study the functors FG and FH between the derived cate ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
categories D(BunG) and D(BunH), which are analogs of the classical thetalifting operators in the framework of the geometric Langlands program. Assume n = m = 1 and H nonsplit, that is, H = π∗Gm with ˜ X connected. We establish the geometric Langlands functoriality for this pair. Namely, we show that FG: D
The ease of including graphics in T E X documents using 4 T E X
"... In this paper we will show how 4 T E X can be used to incorporate graphics in T E X documents. Using 4 T E X it not only becomes easy to include graphics in T E X files, but also makes it possible to preview and print T E X documents (including graphics) on any machine and any printer. For inserting ..."
Abstract
 Add to MetaCart
. For inserting graphics in T E X documents, 4 T E X uses the style file figures.sty, the shareware programs TEXCAD and GRAPHIC WORKSHOP, and the freeware programs: HP2XX, BM2FONT, PCLTOMSP, and GHOSTSCRIPT. All these programs are discussed and we also discuss how 4 T E X uses the strength of these programs
Sergey Lysenko
, 2005
"... 1.0 This paper, which is a sequel to [6], is a step towards a geometric version of the Howe correspondence (an analogue of the thetalifting in the framework of the geometric Langlands program). We consider only the (unramified) dual reductive pair (H = GO2m,G = GSp2n) over ..."
Abstract
 Add to MetaCart
1.0 This paper, which is a sequel to [6], is a step towards a geometric version of the Howe correspondence (an analogue of the thetalifting in the framework of the geometric Langlands program). We consider only the (unramified) dual reductive pair (H = GO2m,G = GSp2n) over
Sergey Lysenko
, 2005
"... 1.0 This paper, which is a sequel to [7], is a step towards a geometric version of the Howe correspondence (an analogue of the thetalifting in the framework of the geometric Langlands program). We consider only the (unramified) dual reductive pair (H = GO 2m,G = GSp 2n) over ..."
Abstract
 Add to MetaCart
1.0 This paper, which is a sequel to [7], is a step towards a geometric version of the Howe correspondence (an analogue of the thetalifting in the framework of the geometric Langlands program). We consider only the (unramified) dual reductive pair (H = GO 2m,G = GSp 2n) over
Results 1  10
of
78