Sciweavers

7200 search results - page 303 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
16 years 26 days ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
ICPPW
2006
IEEE
16 years 22 days ago
m-LPN: An Approach Towards a Dependable Trust Model for Pervasive Computing Applications
Trust, the fundamental basis of ‘cooperation’ – one of the most important characteristics for the performance of pervasive ad hoc network-- is under serious threat with the ...
Munirul M. Haque, Sheikh Iqbal Ahamed
EH
2005
IEEE
119views Hardware» more  EH 2005»
16 years 10 days ago
Evolutionary Computation Technologies for the Automated Design of Space Systems
The Evolvable Computation Group, at NASA’s Jet Propulsion Laboratory, is tasked with demonstrating the utility of computational engineering and computer optimized design for com...
Richard Terrile, Hrand Aghazarian, Michael I. Ferg...
IPPS
2005
IEEE
16 years 9 days ago
MaTCH : Mapping Data-Parallel Tasks on a Heterogeneous Computing Platform Using the Cross-Entropy Heuristic
We propose in this paper a heuristic for mapping a set of interacting tasks of a parallel application onto a heterogeneous computing platform such as a computational grid. Our nov...
Soumya Sanyal, Sajal K. Das
ICDCS
2002
IEEE
15 years 11 months ago
Balancing Performance, Energy, and Quality in Pervasive Computing
We describe Spectra, a remote execution system for batterypowered clients used in pervasive computing. Spectra enables applications to combine the mobility of small devices with t...
Jason Flinn, SoYoung Park, Mahadev Satyanarayanan