Sciweavers

580 search results - page 86 / 116
» On the memory complexity of the forward-backward algorithm
Sort
View
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 6 months ago
Dynamic Scheduling of Skippable Periodic Tasks with Energy Efficiency in Weakly Hard Real-Time System
Energy consumption is a critical design issue in real-time systems, especially in battery- operated systems. Maintaining high performance, while extending the battery life between...
Santhi Baskaran, P. Thambidurai
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 9 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
14 years 26 days ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
ICCV
2007
IEEE
14 years 11 months ago
Spectral Regression for Efficient Regularized Subspace Learning
Subspace learning based face recognition methods have attracted considerable interests in recent years, including Principal Component Analysis (PCA), Linear Discriminant Analysis ...
Deng Cai, Xiaofei He, Jiawei Han
IEEEPACT
2009
IEEE
14 years 3 months ago
Automatic Tuning of Discrete Fourier Transforms Driven by Analytical Modeling
—Analytical models have been used to estimate optimal values for parameters such as tile sizes in the context of loop nests. However, important algorithms such as fast Fourier tr...
Basilio B. Fraguela, Yevgen Voronenko, Markus P&uu...