Sciweavers

429 search results - page 67 / 86
» Improved Algorithms for the k Maximum-Sums Problems
Sort
View
RTAS
2003
IEEE
15 years 3 months ago
An Integrated Approach for Applying Dynamic Voltage Scaling to Hard Real-Time Systems
Wireless and portable devices depend on the limited power supplied by the battery. Dynamic Voltage Scaling (DVS) is an effective method to reduce CPU power consumption. For real-t...
Yanbin Liu, Aloysius K. Mok
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
14 years 11 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
COCO
2007
Springer
91views Algorithms» more  COCO 2007»
15 years 4 months ago
Lower Bounds for Multi-Player Pointer Jumping
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
Amit Chakrabarti
MOBIHOC
2008
ACM
15 years 9 months ago
Dynamic packet fragmentation for wireless channels with failures
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
Predrag R. Jelenkovic, Jian Tan
SIGIR
2009
ACM
15 years 4 months ago
Temporal collaborative filtering with adaptive neighbourhoods
Recommender Systems, based on collaborative filtering (CF), aim to accurately predict user tastes, by minimising the mean error achieved on hidden test sets of user ratings, afte...
Neal Lathia, Stephen Hailes, Licia Capra