Results 1  10
of
1,085,079
Computing nontrivial shortest cycles . . .
, 2006
"... We present an algorithm that computes a shortest noncontractible and a shortest nonseparating cycle on an orientable combinatorial surface of bounded genus in O(n log n) time, where n denotes the complexity of the surface. This solves a central open problem in computational topology, improving upon ..."
Abstract
 Add to MetaCart
upon the currentbest O(n 3/2)time algorithm by Cabello and Mohar (ESA 2005). Our algorithm is based on universalcover constructions to find short cycles and makes extensive use of existing tools from the field.
Computing shortest nontrivial cycles on orientable surfaces of bounded genus in almost linear time
 In SOCG ’06: Proc. 22nd Symp. Comput. Geom
, 2006
"... We present an algorithm that computes a shortest noncontractible and a shortest nonseparating cycle on an orientable combinatorial surface of bounded genus in O(n log n) time, where n denotes the complexity of the surface. This solves a central open problem in computational topology, improving upon ..."
Abstract

Cited by 35 (0 self)
 Add to MetaCart
upon the currentbest O(n 3/2)time algorithm by Cabello and Mohar (ESA 2005). Our algorithm uses universalcover constructions to find short cycles and makes extensive use of existing tools from the field. 1
Objects and Views
 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1991
"... Objectoriented databases have been introduced primarily to ease the development of database applications. However, the difficulties encountered when, for instance, trying to restructure data or integrate databases demonstrate that the models being used still lack flexibility. We claim that the natu ..."
Abstract

Cited by 258 (9 self)
 Add to MetaCart
Objectoriented databases have been introduced primarily to ease the development of database applications. However, the difficulties encountered when, for instance, trying to restructure data or integrate databases demonstrate that the models being used still lack flexibility. We claim that the natural way to overcome these shortcomings is to introduce a sophisticated view mechanism. This paper presents such a mechanism, one which allows a programmer to restructure the class hierarchy and modify the behavior and structure of objects. The mechanism allows a programmer to specify attribute values implicitly, rather than storing them. It also allows him to introduce new classes into the class hierarchy. These virtual classes are populated by selecting existing objects from other classes and by creating new objects. Fixing the identify of new objects during database updates introduces subtle issues into view design. Our presentation, mostly informal, leans on a number of illustrative examples meant to emphasize the simplicity of our mechanism. 1
The AdS5 × S 5 superstring worldsheet Smatrix and crossing symmetry
, 2008
"... An Smatrix satisying the YangBaxter equation with symmetries relevant to the AdS5 × S 5 superstring has recently been determined up to an unknown scalar factor. Such scalar factors are typically fixed using crossing relations, however due to the lack of conventional relativistic invariance, in thi ..."
Abstract

Cited by 228 (6 self)
 Add to MetaCart
rapidities living on the universal cover of the parameter space which is constructed through an auxillary, coupling constant dependent, elliptic curve. We determine the crossing transformation and write functional equations for the scalar factor of the Smatrix in the generalized rapidity plane.
Extracting paraphrases from a parallel corpus
 In Proc. of the ACL/EACL
, 2001
"... While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semiautomatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple English translations of th ..."
Abstract

Cited by 252 (6 self)
 Add to MetaCart
While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semiautomatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple English translations of the same source text. Our approach yields phrasal and single word lexical paraphrases as well as syntactic paraphrases. 1
Hausdorff Convergence and Universal Covers
 Transactions of the American Mathematical Society
"... We prove that if Y is the GromovHausdorff limit of a sequence of compact manifolds, M n i, with a uniform lower bound on Ricci curvature and a uniform upper bound on diameter, then Y has a universal cover. We then show that, for i sufficiently large, the fundamental group of Mi has a surjective hom ..."
Abstract

Cited by 26 (16 self)
 Add to MetaCart
We prove that if Y is the GromovHausdorff limit of a sequence of compact manifolds, M n i, with a uniform lower bound on Ricci curvature and a uniform upper bound on diameter, then Y has a universal cover. We then show that, for i sufficiently large, the fundamental group of Mi has a surjective
The Constructive Semantics of Pure Esterel
, 1996
"... Esterel [8, 10, 3, 4] is an imperative synchronous parallel programming lan guage dedicated to reactive systems [17]. Esterel is tailored for programming hardware or software synchronous controllers for which the controlhandling aspects are predominant. Esterel programs are inputdriven: they wait ..."
Abstract

Cited by 116 (2 self)
 Add to MetaCart
Esterel [8, 10, 3, 4] is an imperative synchronous parallel programming lan guage dedicated to reactive systems [17]. Esterel is tailored for programming hardware or software synchronous controllers for which the controlhandling aspects are predominant. Esterel programs are inputdriven: they wait for inputs and compute corresponding outputs in a cyclebased way. An in putoutput computation is called a reaction...
Results 1  10
of
1,085,079