Sciweavers

921 search results - page 46 / 185
» Expressing Computational Complexity in Constructive Type The...
Sort
View
PODS
2008
ACM
250views Database» more  PODS 2008»
14 years 8 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
LOGCOM
2007
126views more  LOGCOM 2007»
13 years 7 months ago
Causality and Counterfactuals in the Situation Calculus
Structural causal models offer a popular framework for exploring causal concepts. However, due to their limited expressiveness, structural models have difficulties coping with su...
Mark Hopkins, Judea Pearl
FOCS
2009
IEEE
14 years 2 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
FMSD
2006
183views more  FMSD 2006»
13 years 7 months ago
An algebraic theory for behavioral modeling and protocol synthesis in system design
The design productivity gap has been recognized by the semiconductor industry as one of the major threats to the continued growth of system-on-chips and embedded systems. Ad-hoc sy...
Jean-Pierre Talpin, Paul Le Guernic
CALCO
2005
Springer
104views Mathematics» more  CALCO 2005»
14 years 1 months ago
Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories
Scalars, Loops, and Free Traced and Strongly Compact Closed Categories Samson Abramsky Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, U.K. htt...
Samson Abramsky