CORR
2007
Springer
14 years 13 days ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
CORR
2007
Springer
14 years 13 days ago
2007
Springer
In textual knowledge management, statistical methods prevail. Nonetheless, some difficulties cannot be overcome by these methodologies. I propose a symbolic approach using a comp...
CORR
2007
Springer
14 years 13 days ago
2007
Springer
CORR
2007
Springer
14 years 13 days ago
2007
Springer
CORR
2007
Springer
14 years 13 days ago
2007
Springer
CORR
2007
Springer
14 years 13 days ago
2007
Springer
We consider the problem of transmitting data at rate R over a state dependent channel p(ylx, s) with the state information available at the sender and at the same time conveying th...
CORR
2007
Springer
14 years 13 days ago
2007
Springer
CORR
2007
Springer
14 years 13 days ago
2007
Springer
CORR
2007
Springer
14 years 13 days ago
2007
Springer
CORR
2007
Springer
14 years 13 days ago
2007
Springer
The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionali...