Sciweavers

1278 search results - page 63 / 256
» The Complexity of Weighted Boolean
Sort
View
SAT
2004
Springer
101views Hardware» more  SAT 2004»
14 years 1 months ago
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
Michael Bauland, Philippe Chapdelaine, Nadia Creig...
ICTCS
2003
Springer
14 years 28 days ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
ACISP
2006
Springer
14 years 1 months ago
On Exact Algebraic [Non-]Immunity of S-Boxes Based on Power Functions
In this paper we are interested in algebraic immunity of several well known highly-nonlinear vectorial Boolean functions (or Sboxes), designed for block and stream ciphers. Unfortu...
Nicolas Courtois, Blandine Debraize, Eric Garrido
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
13 years 12 months ago
An Efficient Design Method for Optimal Weighted Median Filtering
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
Ruikang Yang, Moncef Gabbouj, Yrjö Neuvo
BMCBI
2010
74views more  BMCBI 2010»
13 years 7 months ago
A weighted q-gram method for glycan structure classification
Background: Glycobiology pertains to the study of carbohydrate sugar chains, or glycans, in a particular cell or organism. Many computational approaches have been proposed for ana...
Limin Li, Wai-Ki Ching, Takako Yamaguchi, Kiyoko F...