Sciweavers

199 search results - page 23 / 40
» Denotations for Classical Proofs - Preliminary Results
Sort
View
JAPLL
2010
98views more  JAPLL 2010»
13 years 6 months ago
On database query languages for K-relations
The relational model has recently been extended to so-called K-relations in which tuples are assigned a unique value in a semiring K. A query language, denoted by RAC K , similar ...
Floris Geerts, Antonella Poggi
ICTAI
2010
IEEE
13 years 5 months ago
A New Filtering Based on Decomposition of Constraint Sub-Networks
In this paper, we introduce a new partial consistency for constraint networks which is called Structural Consistency of level w and is denoted w-SC consistency. This consistency i...
Philippe Jégou, Cyril Terrioux
CAGD
2011
13 years 2 months ago
Regularization of B-spline objects
By a d-dimensional B-spline object (denoted as Od ), we mean a B-spline curve (d = 1), a B-spline surface (d = 2) or a B-spline volume (d = 3). By regularization of a B-spline obj...
Guoliang Xu, Chandrajit L. Bajaj
CIE
2007
Springer
14 years 1 months ago
Speed-Up Theorems in Type-2 Computation
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
Chung-Chih Li
SIAMCOMP
2002
113views more  SIAMCOMP 2002»
13 years 7 months ago
A Layered Analysis of Consensus
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...
Yoram Moses, Sergio Rajsbaum