Sciweavers

922 search results - page 36 / 185
» On a Generalization of the Stone-Weierstrass Theorem
Sort
View
DCG
2011
14 years 9 months ago
More Colourful Simplices
We show that any point in the convex hull of each of (d +1) sets of (d +1) points in general position in Rd is contained in at least (d + 1)2/2 simplices with one vertex from each ...
Antoine Deza, Tamon Stephen, Feng Xie
CADE
2007
Springer
16 years 2 months ago
ALICE: An Advanced Logic for Interactive Component Engineering
This paper presents an overview of the verication framework ALICE in its current version 0.7. It is based on the generic theorem prover Isabelle [Pau03a]. Within ALICE a software o...
Borislav Gajanovic, Bernhard Rumpe
STOC
2004
ACM
117views Algorithms» more  STOC 2004»
16 years 2 months ago
New notions of security: achieving universal composability without trusted setup
We propose a modification to the framework of Universally Composable (UC) security [3]. Our new notion, involves comparing the protocol executions with an ideal execution involvin...
Manoj Prabhakaran, Amit Sahai
CHES
2007
Springer
105views Cryptology» more  CHES 2007»
15 years 8 months ago
On the Implementation of a Fast Prime Generation Algorithm
Abstract. A side-channel analysis of a cryptographic algorithm generally concentrates on the encryption or decryption phases, rarely on the key generation phase. In this paper, we ...
Christophe Clavier, Jean-Sébastien Coron
LION
2007
Springer
138views Optimization» more  LION 2007»
15 years 8 months ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo