2542 search results - page 332 / 509 » Computing Cartograms with Optimal Complexity |
WAOA
2004
Springer
14 years 4 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
ISCAS
2003
IEEE
14 years 4 months ago
2003
IEEE
The hardware complexity of digital filters is not controllable by straightforwardly rounding the coefficients to the quantization levels. In this paper, we propose an effective al...
ISCAS
2003
IEEE
14 years 4 months ago
2003
IEEE
Maximum Likelihood estimation theory can be used to develop optimal timing recovery schemes for digital communication systems. Tunable digital interpolation filters are commonly ...
COMPGEOM
2003
ACM
14 years 4 months ago
2003
ACM
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
DAWAK
2003
Springer
14 years 4 months ago
2003
Springer
View materialization is recognized to be one of the most effective ways to increase the Data Warehouse performance; nevertheless, due to the computational complexity of the techniq...