Sciweavers

1434 search results - page 112 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
IEEEIAS
2007
IEEE
14 years 4 months ago
Generative Models for Fingerprint Individuality using Ridge Types
Generative models of pattern individuality attempt to represent the distribution of observed quantitative features, e.g., by learning parameters from a database, and then use such...
Gang Fang, Sargur N. Srihari, Harish Srinivasan
JOC
2007
94views more  JOC 2007»
13 years 10 months ago
On Unconditionally Secure Distributed Oblivious Transfer
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...
Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Dou...
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 5 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
14 years 4 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
TSP
2010
13 years 4 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat