Sciweavers

1942 search results - page 219 / 389
» HINT: A new way to measure computer performance
Sort
View
WAOA
2004
Springer
112views Algorithms» more  WAOA 2004»
15 years 12 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
ICALT
2003
IEEE
15 years 12 months ago
Online Self-Assessment as a Learning Method
Algorithms and Programming Languages is a core subject in the BS Degree in Mathematics at the authors’ university. Some of the students are very interested in computer programmi...
Daniel Gayo-Avello, Hortensia Fernández-Cue...
ICC
2000
IEEE
15 years 11 months ago
Adaptive Interleaving for OFDM in TDD Systems
We proposed a novel interleaving technique, namely ada,ptive interleaving, which can break the bursty channel errors more effectively than traditional block interleaving. This new...
S. W. Lei, Vincent K. N. Lau, Tung-Sang Ng
CGF
2005
111views more  CGF 2005»
15 years 6 months ago
Pinchmaps: textures with customizable discontinuities
We introduce a new texture representation that combines standard sampling, to be bilinearly interpolated in smoothly varying regions, with customizable discontinuities, to model s...
Marco Tarini, Paolo Cignoni
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 6 months ago
Gravitational tree-code on graphics processing units: implementation in CUDA
We present a new very fast tree-code which runs on massively parallel Graphical Processing Units (GPU) with NVIDIA CUDA architecture. The tree-construction and calculation of mult...
Evghenii Gaburov, Jeroen Bédorf, Simon Port...