Sciweavers

CORR
2008
Springer
100views Education» more  CORR 2008»
13 years 8 months ago
Graph-Based Classification of Self-Dual Additive Codes over Finite Fields
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the genera...
Lars Eirik Danielsen
CORR
2008
Springer
144views Education» more  CORR 2008»
13 years 8 months ago
Modular Compilation of a Synchronous Language
Synchronous languages rely on formal methods to ease the development of applications in an efficient and reusable way. Formal methods have been advocated as a means of increasing t...
Annie Ressouche, Daniel Gaffé, Valér...
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 8 months ago
A Single-Instance Incremental SAT Formulation of Proof- and Counterexample-Based Abstraction
nd Counterexample-Based Abstraction Niklas Een, Alan Mishchenko EECS Department, University of California Berkeley, USA. Nina Amla Cadence Research Laboratroy Berkeley, USA. This p...
Niklas Eén, Alan Mishchenko, Nina Amla
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 8 months ago
Picking up the Pieces: Self-Healing in Reconfigurable Networks
We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity...
Jared Saia, Amitabh Trehan
CORR
2010
Springer
79views Education» more  CORR 2010»
13 years 8 months ago
For the sake of simplicity: Unsupervised extraction of lexical simplifications from Wikipedia
We report on work in progress on extracting lexical simplifications (e.g., "collaborate" "work together"), focusing on utilizing edit histories in Simple Engli...
Mark Yatskar, Bo Pang, Cristian Danescu-Niculescu-...
CORR
2010
Springer
62views Education» more  CORR 2010»
13 years 8 months ago
Guessing Revisited: A Large Deviations Approach
The problem of guessing a random string is revisited and some prior results on guessing exponents are re-derived using the theory of large deviations. It is shown that if the seque...
Manjesh Kumar Hanawal, Rajesh Sundaresan
CORR
2008
Springer
100views Education» more  CORR 2008»
13 years 8 months ago
Merkle Puzzles are Optimal
Boaz Barak, Mohammad Mahmoody-Ghidary
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 8 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 8 months ago
Multiparty Communication Complexity of Disjointness
We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of mul...
Arkadev Chattopadhyay, Anil Ada
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 8 months ago
Design and Modeling Billing solution to Next Generation Networks
-------------------------------------------------------------------ABSTRACT----------------------------------------------------------------Next generation networks (NGN) services a...
Kamaljit I. Lakhtaria, N. N. Jani