Sciweavers

5463 search results - page 1072 / 1093
» Evaluating algorithms that learn from data streams
Sort
View
ACMMSP
2004
ACM
92views Hardware» more  ACMMSP 2004»
15 years 3 months ago
Instruction combining for coalescing memory accesses using global code motion
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatan...
ICS
2009
Tsinghua U.
15 years 2 months ago
Exploring pattern-aware routing in generalized fat tree networks
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
Germán Rodríguez, Ramón Beivi...
SENSYS
2010
ACM
14 years 8 months ago
Cooperative transit tracking using smart-phones
Real-time transit tracking is gaining popularity as a means for transit agencies to improve the rider experience. However, many transit agencies lack either the funding or initiat...
Arvind Thiagarajan, James Biagioni, Tomas Gerlich,...
PPOPP
2012
ACM
13 years 5 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
69
Voted
BMCBI
2007
112views more  BMCBI 2007»
14 years 10 months ago
AUG_hairpin: prediction of a downstream secondary structure influencing the recognition of a translation start site
Background: The translation start site plays an important role in the control of translation efficiency of eukaryotic mRNAs. The recognition of the start AUG codon by eukaryotic r...
Alexey V. Kochetov, Andrey Palyanov, Igor I. Titov...
« Prev « First page 1072 / 1093 Last » Next »