Sciweavers

19320 search results - page 3538 / 3864
» On the complexity of computing determinants
Sort
View
SPIRE
2010
Springer
15 years 5 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
TASLP
2010
99views more  TASLP 2010»
15 years 5 months ago
A Virtual Model of Spring Reverberation
—The digital emulation of analog audio effects and synthesis components, through the simulation of lumped circuit components has seen a large amount of activity in recent years; ...
Stefan Bilbao, Julian Parker
TC
2010
15 years 5 months ago
A Novel Weighted-Graph-Based Grouping Algorithm for Metadata Prefetching
— Although data prefetching algorithms have been extensively studied for years, there is no counterpart research done for metadata access performance. Existing data prefetching a...
Peng Gu, Jun Wang, Yifeng Zhu, Hong Jiang, Pengju ...
TCOM
2010
115views more  TCOM 2010»
15 years 5 months ago
QoS Analysis of a Scheduling Policy for Heterogeneous Users Employing AMC Jointly with ARQ
—This paper analyzes the quality of service (QoS) of scheduling algorithms for heterogeneous users in multiuser (MU) wireless systems that take advantage from a crosslayer design...
Mario Poggioni, Luca Rugini, Paolo Banelli
VLSI
2010
Springer
15 years 5 months ago
Design of low-complexity and high-speed digital Finite Impulse Response filters
—In this paper, we introduce a design methodology to implement low-complexity and high-speed digital Finite Impulse Response (FIR) filters. Since FIR filters suffer from a larg...
Diego Jaccottet, Eduardo Costa, Levent Aksoy, Paul...
« Prev « First page 3538 / 3864 Last » Next »