Sciweavers

1159 search results - page 205 / 232
» On The Next Move in Programming
Sort
View
CSFW
2009
IEEE
14 years 3 months ago
More Anonymous Onion Routing Through Trust
We consider using trust information to improve the anonymity provided by onion-routing networks. In particular, we introduce a model of trust in network nodes and use it to design...
Aaron Johnson, Paul F. Syverson
CANDC
2009
ACM
14 years 3 months ago
Exploring illuminative systems in informal networks of adults
Whenever we feel those ‘higher’ and hard to define sensations like synchronicity, love, wholeness, and appreciation is this a pattern or illuminative system that is part of a ...
Amy K. Scatliff
CF
2009
ACM
14 years 3 months ago
Mapping the LU decomposition on a many-core architecture: challenges and solutions
Recently, multi-core architectures with alternative memory subsystem designs have emerged. Instead of using hardwaremanaged cache hierarchies, they employ software-managed embedde...
Ioannis E. Venetis, Guang R. Gao
SIGMETRICS
2009
ACM
126views Hardware» more  SIGMETRICS 2009»
14 years 3 months ago
Self-adaptive admission control policies for resource-sharing systems
We consider the problem of admission control in resource sharing systems, such as web servers and transaction processing systems, when the job size distribution has high variabili...
Varun Gupta, Mor Harchol-Balter
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 3 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng