Sciweavers

5153 search results - page 627 / 1031
» Introduction to Randomized Algorithms
Sort
View
SIGMETRICS
2011
ACM
178views Hardware» more  SIGMETRICS 2011»
15 years 15 hour ago
Should we worry about memory loss?
In recent years the High Performance Computing (HPC) industry has benefited from the development of higher density multi-core processors. With recent chips capable of executing u...
O. Perks, Simon D. Hammond, S. J. Pennycook, Steph...
TSP
2011
151views more  TSP 2011»
15 years 8 hour ago
Stochastic Models for Sparse and Piecewise-Smooth Signals
Abstract—We introduce an extended family of continuous-domain stochastic models for sparse, piecewise-smooth signals. These are specified as solutions of stochastic differential...
Michael Unser, Pouya Dehghani Tafti
JMLR
2010
165views more  JMLR 2010»
14 years 12 months ago
Learning with Blocks: Composite Likelihood and Contrastive Divergence
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
Arthur Asuncion, Qiang Liu, Alexander T. Ihler, Pa...
161
Voted
TIT
2010
146views Education» more  TIT 2010»
14 years 11 months ago
Information propagation speed in mobile and delay tolerant networks
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...
Philippe Jacquet, Bernard Mans, Georgios Rodolakis
TIT
2010
82views Education» more  TIT 2010»
14 years 11 months ago
Average message delivery time for small-world networks in the continuum limit
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
Hazer Inaltekin, Mung Chiang, H. Vincent Poor