Sciweavers

CORR
2008
Springer
125views Education» more  CORR 2008»
13 years 11 months ago
Semidefinite programming for N-Player Games
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
Rida Laraki, Jean B. Lasserre
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 11 months ago
Divisibility, Smoothness and Cryptographic Applications
This paper deals with products of moderate-size primes, familiarly known as smooth numbers. Smooth numbers play an crucial role in information theory, signal processing and crypto...
David Naccache, Igor Shparlinski
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 11 months ago
Model checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 11 months ago
An Activity-Based Model for Separation of Duty
This paper offers several contributions for separation of duty (SoD) administration in role-based access control (RBAC) systems. We first introduce a new formal framework, based o...
Alessandro Colantonio, Roberto Di Pietro, Alberto ...
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 11 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
CORR
2008
Springer
99views Education» more  CORR 2008»
13 years 11 months ago
Exponential-Time Approximation of Hard Problems
Marek Cygan, Lukasz Kowalik, Marcin Pilipczuk, Mat...
CORR
2008
Springer
197views Education» more  CORR 2008»
13 years 11 months ago
Sequential adaptive compressed sampling via Huffman codes
In this paper we introduce an information theoretic approach and use techniques from the theory of Huffman codes to construct a sequence of binary sampling vectors to determine a s...
Akram Aldroubi, Haichao Wang, Kourosh Zarringhalam
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 11 months ago
XQuery Join Graph Isolation
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional X...
Torsten Grust, Manuel Mayr, Jan Rittinger
CORR
2008
Springer
136views Education» more  CORR 2008»
13 years 11 months ago
On the Capacity and Generalized Degrees of Freedom of the X Channel
We explore the capacity and generalized degrees of freedom of the 2-user Gaussian X channel, i.e. a generalization of the 2-user interference channel where there is an independent...
Chiachi Huang, Viveck R. Cadambe, Syed Ali Jafar
CORR
2008
Springer
70views Education» more  CORR 2008»
13 years 11 months ago
On Granular Knowledge Structures
Yi Zeng, Ning Zhong