Sciweavers

2745 search results - page 509 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
PERCOM
2010
ACM
15 years 2 months ago
Privacy assurance in mobile sensing networks: Go beyond trusted servers
—Mobile devices are becoming the largest sensor network around the world. They could be used to collect a large amount of data with little effort and cost which is leading to a p...
Ling Hu, Cyrus Shahabi
HPCA
2011
IEEE
14 years 7 months ago
Archipelago: A polymorphic cache design for enabling robust near-threshold operation
Extreme technology integration in the sub-micron regime comes with a rapid rise in heat dissipation and power density for modern processors. Dynamic voltage scaling is a widely us...
Amin Ansari, Shuguang Feng, Shantanu Gupta, Scott ...
ICASSP
2007
IEEE
15 years 10 months ago
Evolutionary Sequence Modeling for Discovery of Peptide Hormones
There are currently a large number of ‘‘orphan’’ G-protein-coupled receptors (GPCRs) whose endogenous ligands (peptide hormones) are unknown. Identification of these pepti...
M. Kemal Sönmez, Lawrence Toll, Nina Zaveri
169
Voted
ICPADS
1994
IEEE
15 years 8 months ago
Stochastic Modeling of Scaled Parallel Programs
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
CIE
2010
Springer
15 years 8 months ago
How Powerful Are Integer-Valued Martingales?
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
Laurent Bienvenu, Frank Stephan, Jason Teutsch