Sciweavers

1945 search results - page 297 / 389
» Speeding up Serpent
Sort
View
AIIA
2007
Springer
15 years 1 months ago
Tonal Harmony Analysis: A Supervised Sequential Learning Approach
We have recently presented CarpeDiem, an algorithm that can be used for speeding up the evaluation of Supervised Sequential Learning (SSL) classifiers. CarpeDiem provides impress...
Daniele P. Radicioni, Roberto Esposito
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
15 years 1 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan
DAMON
2008
Springer
15 years 1 months ago
Fast scans and joins using flash drives
As access times to main memory and disks continue to diverge, faster non-volatile storage technologies become more attractive for speeding up data analysis applications. NAND flas...
Mehul A. Shah, Stavros Harizopoulos, Janet L. Wien...
EUROPAR
2008
Springer
15 years 1 months ago
Exploiting Hybrid Parallelism in Web Search Engines
Abstract. With the emergence of multi-core CPU (or Chip-level MultiProcessor -CMP-), it is essential to develop techniques that capitalize on CMP's advantages to speed up very...
Carolina Bonacic, Carlos García, Mauricio M...
AAAI
2010
15 years 22 days ago
Robust Policy Computation in Reward-Uncertain MDPs Using Nondominated Policies
The precise specification of reward functions for Markov decision processes (MDPs) is often extremely difficult, motivating research into both reward elicitation and the robust so...
Kevin Regan, Craig Boutilier