Sciweavers

2080 search results - page 333 / 416
» Measuring empirical computational complexity
Sort
View
ICPPW
2005
IEEE
15 years 12 months ago
A Practical Approach to the Rating of Barrier Algorithms Using the LogP Model and Open MPI
Large–scale parallel applications performing global synchronization may spend a significant amount of execution time waiting for the completion of a barrier operation. Conseque...
Torsten Hoefler, Lavinio Cerquetti, Torsten Mehlan...
CHES
2005
Springer
149views Cryptology» more  CHES 2005»
15 years 11 months ago
Resistance of Randomized Projective Coordinates Against Power Analysis
Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms us...
William Dupuy, Sébastien Kunz-Jacques
EMMCVPR
2005
Springer
15 years 11 months ago
Optimizing the Cauchy-Schwarz PDF Distance for Information Theoretic, Non-parametric Clustering
This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data pattern...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
15 years 11 months ago
Designing resilient networks using a hybrid genetic algorithm approach
As high-speed networks have proliferated across the globe, their topologies have become sparser due to the increased capacity of communication media and cost considerations. Relia...
Abdullah Konak, Alice E. Smith
DSN
2003
IEEE
15 years 11 months ago
Benchmarking the Dependability of Different OLTP Systems
On-Line Transaction Processing (OLTP) systems constitute the kernel of the information systems used today to support the daily operations of most organizations. Although these sys...
Marco Vieira, Henrique Madeira