Sciweavers

57 search results - page 10 / 12
» Generalizations of matched CNF formulas
Sort
View
SIGMOD
2008
ACM
122views Database» more  SIGMOD 2008»
13 years 7 months ago
UQBE: uncertain query by example for web service mashup
The UQBE is a mashup tool for non-programmers that supports query-by-example (QBE) over a schema made up by the user without knowing the schema of the original sources. Based on a...
Jun'ichi Tatemura, Songting Chen, Fenglin Liao, Ol...
ENTCS
2011
129views more  ENTCS 2011»
13 years 2 months ago
Specifying Proof Systems in Linear Logic with Subexponentials
In the past years, linear logic has been successfully used as a general logical framework for encoding proof systems. Due to linear logic’s finer control on structural rules, i...
Vivek Nigam, Elaine Pimentel, Giselle Reis
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 7 months ago
Tight Bounds on the Capacity of Binary Input random CDMA Systems
Abstract-- We consider code division multiple access communication over a binary input additive white Gaussian noise channel using random spreading. For a general class of symmetri...
Satish Babu Korada, Nicolas Macris
JCAM
2010
107views more  JCAM 2010»
13 years 2 months ago
Pricing and hedging Asian basket spread options
Asian options, basket options and spread options have been extensively studied in literature. However, few papers deal with the problem of pricing general Asian basket spread opti...
Griselda Deelstra, Alexandre Petkovic, Michè...
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 7 months ago
On the Complexity of Elementary Modal Logics
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
Edith Hemaspaandra, Henning Schnoor