Sciweavers

514 search results - page 59 / 103
» On the Structure of Valiant's Complexity Classes
Sort
View
COMPSYSTECH
2011
12 years 8 months ago
Encoding watermark numbers as cographs using self-inverting permutations
Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. ...
Maria Chroni, Stavros D. Nikolopoulos
BMCBI
2011
13 years 9 days ago
A hierarchical Bayesian network approach for linkage disequilibrium modeling and data-dimensionality reduction prior to genome-w
Background: Discovering the genetic basis of common genetic diseases in the human genome represents a public health issue. However, the dimensionality of the genetic data (up to 1...
Raphael Mourad, Christine Sinoquet, Philippe Leray
CSFW
2010
IEEE
14 years 1 days ago
A Framework for the Sound Specification of Cryptographic Tasks
Nowadays it is widely accepted to formulate the security of a protocol carrying out a given task via the "trusted-party paradigm," where the protocol execution is compar...
Juan A. Garay, Aggelos Kiayias, Hong-Sheng Zhou
SIGMOD
2006
ACM
194views Database» more  SIGMOD 2006»
14 years 8 months ago
Graph-based synopses for relational selectivity estimation
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
Joshua Spiegel, Neoklis Polyzotis
LFCS
2007
Springer
14 years 2 months ago
Model Checking Knowledge and Linear Time: PSPACE Cases
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
Kai Engelhardt, Peter Gammie, Ron van der Meyden