CORR
2006
Springer
13 years 11 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract-- In this paper we consider the communication problem that involves transmission of correlated sources over broadcast channels. We consider a graph-based framework for thi...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We present an accurate Lagrangian method based on vortex particles, level-sets, and immersed boundary methods, for animating the interplay between two fluids and rigid solids. We ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
: Recent works have investigated the problem of the conflict redistribution in the fusion rules of evidence theories. As a consequence of these works, many new rules have been prop...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We propose a theory of eigenvalues, eigenvectors, singular values, and singular vectors for tensors based on a constrained variational approach much like the Rayleigh quotient for...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
