Sciweavers

1916 search results - page 225 / 384
» Reasoning with class algebra
Sort
View
MSCS
2007
92views more  MSCS 2007»
13 years 9 months ago
Restriction categories III: colimits, partial limits and extensivity
ction category is an abstract formulation for a category of partial maps, defined in terms of certain specified idempotents called the restriction idempotents. All categories of...
J. Robin B. Cockett, Stephen Lack
JACM
2010
116views more  JACM 2010»
13 years 8 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
PLDI
2011
ACM
13 years 1 months ago
Evaluating value-graph translation validation for LLVM
Translation validators are static analyzers that attempt to verify that program transformations preserve semantics. Normalizing translation validators do so by trying to match the...
Jean-Baptiste Tristan, Paul Govereau, Greg Morrise...
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
14 years 4 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 10 months ago
Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design
In this paper, we consider single-source, single-sink (ss-ss) multi-hop relay networks, with slow-fading Rayleigh links and single-antenna relay nodes operating under the half-dupl...
K. Sreeram, S. Birenjith, P. Vijay Kumar