2542 search results - page 63 / 509 » Computing Cartograms with Optimal Complexity |
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
We consider spatio-temporal Tomlinson Harashima Precoding where the feedforward filter is located at the transmitter and an additional scalar gain is employed as receive filter....
RECOMB
1997
Springer
14 years 2 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
CEC
2010
IEEE
13 years 11 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
PVLDB
2008
13 years 9 months ago
2008
Where can I attend an interesting database workshop close to a sunny beach? Who are the strongest experts on service computing based upon their recent publication record and accep...
ECAI
2004
Springer
14 years 3 months ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...