247 search results - page 40 / 50 » Extracting All the Randomness from a Weakly Random Source |
ESA
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
IVA
2005
Springer
14 years 1 months ago
2005
Springer
this is via the ”Motion Abstraction”. This is a single abstraction that represents any type of animation of a character. Different implementations of the ion can provide very ...
JMLR
2010
13 years 2 months ago
2010
As the size and dimensionality of data sets increase, the task of feature selection has become increasingly important. In this paper we demonstrate how association rules can be us...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— This paper investigates the dissemination of multiple pieces of information in large networks where users contact each other in a random uncoordinated manner, and users...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
We investigate the fundamental capacity limits of space-time journeys of information in mobile and Delay Tolerant Networks (DTNs), where information is either transmitted or carrie...