Sciweavers

CORR
2008
Springer
58views Education» more  CORR 2008»
14 years 17 days ago
HyperSmooth : calcul et visualisation de cartes de potentiel interactives
Christine Plumejeaud, Jean-Marc Vincent, Claude Gr...
CORR
2008
Springer
61views Education» more  CORR 2008»
14 years 17 days ago
Rich, Sturmian, and trapezoidal words
In this paper we explore various interconnections between rich words, Sturmian words, and trapezoidal words. Rich words, first introduced by the second and third authors together w...
Aldo de Luca, Amy Glen, Luca Q. Zamboni
CORR
2008
Springer
95views Education» more  CORR 2008»
14 years 17 days ago
Simulation of Free Surface Compressible Flows Via a Two Fluid Model
Frédéric Dias, Denys Dutykh, Jean-Mi...
CORR
2008
Springer
92views Education» more  CORR 2008»
14 years 17 days ago
A connection between palindromic and factor complexity using return words
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes...
Michelangelo Bucci, Alessandro De Luca, Amy Glen, ...
CORR
2008
Springer
74views Education» more  CORR 2008»
14 years 17 days ago
On mobile sets in the binary hypercube
If two distance-3 codes have the same neighborhood, then each of them is called a mobile set. In the (4k + 3)-dimensional binary hypercube, there exists a mobile set of cardinality...
Yuriy Vasil'ev, Sergey V. Avgustinovich, Denis S. ...
CORR
2008
Springer
115views Education» more  CORR 2008»
14 years 17 days ago
Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels
Abstract--In this paper, the sum capacity of the Gaussian Multiple Input Multiple Output (MIMO) Cognitive Radio Channel (MCC) is expressed as a convex problem with finite number of...
Rajiv Soundararajan, Sriram Vishwanath
CORR
2008
Springer
104views Education» more  CORR 2008»
14 years 17 days ago
New bounds on classical and quantum one-way communication complexity
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical one-way mode...
Rahul Jain, Shengyu Zhang
CORR
2008
Springer
74views Education» more  CORR 2008»
14 years 17 days ago
Analysis of the Karmarkar-Karp Differencing Algorithm
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
Stefan Boettcher, Stephan Mertens
CORR
2008
Springer
125views Education» more  CORR 2008»
14 years 17 days ago
Sensing Danger: Innate Immunology for Intrusion Detection
The immune system provides an ideal metaphor for anomaly detection in general and computer security in particular. Based on this idea, artificial immune systems have been used for...
Uwe Aickelin, Julie Greensmith