CORR
2006
Springer
13 years 4 months ago
2006
Springer
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
This paper considers the quantization problem on the Grassmann manifold Gn,p, the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space. The ch...
APPML
2006
13 years 4 months ago
2006
We obtain an upper bound on a new type of exponential sums with linear recurrence sequences. We apply this bound to estimate the Fourier coefficients, and thus the nonlinearity, o...
ENDM
2008
13 years 4 months ago
2008
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
DAM
2008
13 years 4 months ago
2008
We consider vertex coloring of an acyclic digraph G in such a way that two vertices which have a common ancestor in G receive distinct colors. Such colorings arise in a natural wa...
DM
2010
13 years 4 months ago
2010
We investigate further the concept of asymptotic connectivity as defined previously by the first author. In particular, we compute an upper bound on the asymptotic connectivity of ...
DM
2010
13 years 4 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We define a class of Z-interference channels for which we obtain a new upper bound on the capacity region. The bound exploits a technique first introduced by Korner and Marton. A ...