Sciweavers

2745 search results - page 157 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
INFOCOM
2009
IEEE
15 years 10 months ago
On Fast Optimal STDMA Scheduling over Fading Wireless Channels
—Most prior studies on wireless spatial-reuse TDMA (STDMA) link scheduling for throughput optimization deal with the situation where instantaneous channel state information (CSI)...
JiaLiang Zhang, Soung Chang Liew, Liqun Fu
BMCBI
2006
93views more  BMCBI 2006»
15 years 4 months ago
A summarization approach for Affymetrix GeneChip data using a reference training set from a large, biologically diverse database
Background: Many of the most popular pre-processing methods for Affymetrix expression arrays, such as RMA, gcRMA, and PLIER, simultaneously analyze data across a set of predetermi...
Simon Katz, Rafael A. Irizarry, Xue Lin, Mark Trip...
130
Voted
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
15 years 10 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
CHES
2005
Springer
155views Cryptology» more  CHES 2005»
15 years 9 months ago
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
Willi Geiselmann, Adi Shamir, Rainer Steinwandt, E...
MICCAI
2008
Springer
16 years 5 months ago
Symmetric Log-Domain Diffeomorphic Registration: A Demons-Based Approach
Abstract. Modern morphometric studies use non-linear image registration to compare anatomies and perform group analysis. Recently, logEuclidean approaches have contributed to promo...
Tom Vercauteren, Xavier Pennec, Aymeric Perchant...