Sciweavers

2542 search results - page 332 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
WAOA
2004
Springer
112views Algorithms» more  WAOA 2004»
14 years 4 months ago
Online Bin Packing with Resource Augmentation
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...
Leah Epstein, Rob van Stee
ISCAS
2003
IEEE
100views Hardware» more  ISCAS 2003»
14 years 4 months ago
Area-effective FIR filter design for multiplier-less implementation
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...
Tay-Jyi Lin, Tsung-Hsun Yang, Chein-Wei Jen
ISCAS
2003
IEEE
172views Hardware» more  ISCAS 2003»
14 years 4 months ago
Efficient symbol synchronization techniques using variable FIR or IIR interpolation filters
Maximum Likelihood estimation theory can be used to develop optimal timing recovery schemes for digital communication systems. Tunable digital interpolation filters are commonly ...
Martin Makundi, Timo I. Laakso
COMPGEOM
2003
ACM
14 years 4 months ago
the asteroid surveying problem and other puzzles
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...
Timothy M. Chan, Alexander Golynski, Alejandro L&o...
DAWAK
2003
Springer
14 years 4 months ago
Handling Large Workloads by Profiling and Clustering
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...
Matteo Golfarelli