Sciweavers

4488 search results - page 163 / 898
» Properties of NP-Complete Sets
Sort
View
CLIMA
2010
13 years 9 months ago
Hypergraphs of Multiparty Secrets
The paper considers interdependencies between secrets in a multiparty system. Each secret is assumed to be known only to a certain fixed set of parties. These sets can be viewed as...
Sara Miner More, Pavel Naumov
CORR
2008
Springer
130views Education» more  CORR 2008»
13 years 8 months ago
Convex Hull of Arithmetic Automata
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
Jérôme Leroux
DCC
2010
IEEE
13 years 8 months ago
Minimum distance of Hermitian two-point codes
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
Seungkook Park
JGO
2008
115views more  JGO 2008»
13 years 8 months ago
Smoothing by mollifiers. Part I: semi-infinite optimization
We show that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a level set of a single smooth function with certain r...
Hubertus Th. Jongen, Oliver Stein
ENTCS
2007
97views more  ENTCS 2007»
13 years 8 months ago
Skeletons, Homomorphisms, and Shapes: Characterizing Protocol Executions
In this paper we develop a framework, based on strand spaces, for reasoning about cryptographic protocols and characterizing their executions. We define skeletons, homomorphisms,...
Shaddin F. Doghmi, Joshua D. Guttman, F. Javier Th...