Sciweavers

3044 search results - page 83 / 609
» Linear logical approximations
Sort
View
SODA
2012
ACM
185views Algorithms» more  SODA 2012»
11 years 11 months ago
On a linear program for minimum-weight triangulation
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
Arman Yousefi, Neal E. Young
FLOPS
2004
Springer
14 years 2 months ago
Semantics of Linear Continuation-Passing in Call-by-Name
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
Masahito Hasegawa
SIAMCOMP
1998
124views more  SIAMCOMP 1998»
13 years 8 months ago
Near-Linear Time Construction of Sparse Neighborhood Covers
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, Davi...
LPAR
2007
Springer
14 years 3 months ago
Completeness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
Marc Bezem, Tore Langholm, Michal Walicki
IANDC
2007
127views more  IANDC 2007»
13 years 8 months ago
Temporal logics with incommensurable distances are undecidable
Temporal logic based on the two modalities “Since” and “Until” (TL) is the most popular logic for the specification of reactive systems. It is often called the linear tim...
Alexander Rabinovich