Sciweavers

CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 8 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise
CORR
2010
Springer
181views Education» more  CORR 2010»
13 years 8 months ago
Mapping XML Data to Relational Data: A DOM-Based Approach
XML has emerged as the standard for representing and exchanging data on the World Wide Web. It is critical to have efficient mechanisms to store and query XML data to exploit the...
Mustafa Atay, Yezhou Sun, Dapeng Liu, Shiyong Lu, ...
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 8 months ago
Computational Complexity of Avalanches in the Kadanoff two-dimensional Sandpile Model
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
Eric Goles Chacc, Bruno Martin
CORR
2010
Springer
155views Education» more  CORR 2010»
13 years 8 months ago
A New Upper Bound on the Average Error Exponent for Multiple-Access Channels
A new lower bound for the average probability or error for a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound has a structure very similar to...
Ali Nazari, S. Sandeep Pradhan, Achilleas Anastaso...
CORR
2010
Springer
282views Education» more  CORR 2010»
13 years 8 months ago
A New Approach in Packet Scheduling in the Vanet
Vehicular Ad hoc Networks (VANET) are expected to have great potential to improve both traffic safety and comfort in the future. When many vehicles want to access data through roa...
Sayadi Mohammad Javad, Fathy Mahmood
CORR
2010
Springer
55views Education» more  CORR 2010»
13 years 8 months ago
Infinite Families of Optimal Splitting Authentication Codes Secure Against Spoofing Attacks of Higher Order
We consider the problem of constructing optimal authentication codes with splitting. New infinite families of such codes are obtained. In particular, we establish the first known...
Yeow Meng Chee, Xiande Zhang, Hui Zhang
CORR
2010
Springer
148views Education» more  CORR 2010»
13 years 8 months ago
List decoding for nested lattices and applications to relay channels
— We demonstrate a decoding scheme for nested lattice codes which is able to decode a list of a particular size which contains the transmitted codeword with high probability. Thi...
Yiwei Song, Natasha Devroye
CORR
2010
Springer
83views Education» more  CORR 2010»
13 years 8 months ago
Multitriangulations, pseudotriangulations and primitive sorting networks
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a notion of flip which transforms a pseudoline arrangement with contact...
Vincent Pilaud, Michel Pocchiola
CORR
2010
Springer
44views Education» more  CORR 2010»
13 years 8 months ago
Combinatorial substitutions and sofic tilings
A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings ar...
Thomas Fernique, Nicolas Ollinger