Sciweavers

321 search results - page 54 / 65
» OPTVIEW: A New Approach for Examining Optimized Code
Sort
View
HIPC
2000
Springer
13 years 11 months ago
Improving Offset Assignment on Embedded Processors Using Transformations
Embedded systems consisting of the application program ROM, RAM, the embedded processor core and any custom hardware on a single wafer are becoming increasingly common in areas suc...
Sunil Atri, J. Ramanujam, Mahmut T. Kandemir
CGF
2011
12 years 11 months ago
Intrinsic Shape Matching by Planned Landmark Sampling
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
Art Tevs, Alexander Berner, Michael Wand, Ivo Ihrk...
VLDB
1998
ACM
127views Database» more  VLDB 1998»
13 years 11 months ago
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuz...
CGO
2007
IEEE
13 years 11 months ago
Profile-assisted Compiler Support for Dynamic Predication in Diverge-Merge Processors
Dynamic predication has been proposed to reduce the branch misprediction penalty due to hard-to-predict branch instructions. A recently proposed dynamic predication architecture, ...
Hyesoon Kim, José A. Joao, Onur Mutlu, Yale...
BMCBI
2011
12 years 11 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes