Sciweavers

1942 search results - page 300 / 389
» Speeding Up XTR
Sort
View
CASES
2008
ACM
15 years 1 months ago
Dynamic coprocessor management for FPGA-enhanced compute platforms
Various commercial programmable compute platforms have their processor architecture enhanced with field-programmable gate arrays (FPGAs). In a common usage scenario, an applicatio...
Chen Huang, Frank Vahid
CC
2008
Springer
172views System Software» more  CC 2008»
15 years 1 months ago
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
The performance of heap analysis techniques has a significant impact on their utility in an optimizing compiler. Most shape analysis techniques perform interprocedural dataflow ana...
Mark Marron, Manuel V. Hermenegildo, Deepak Kapur,...
ACMICEC
2005
ACM
132views ECommerce» more  ACMICEC 2005»
15 years 1 months ago
An empirical look at the problems of open source adoption in Finnish municipalities
This article starts by considering the global framework of current open source migration. We show that the fight against software piracy is most likely speeding up the adoption es...
Mikko Välimäki, Ville Oksanen, Juha Lain...
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