Sciweavers

2354 search results - page 190 / 471
» Randomness, Stochasticity and Approximations
Sort
View
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 10 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
CPC
1999
105views more  CPC 1999»
13 years 9 months ago
Total Path Length For Random Recursive Trees
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
Robert P. Dobrow, James Allen Fill
CDC
2009
IEEE
150views Control Systems» more  CDC 2009»
14 years 2 months ago
Cooperative adaptive sampling via approximate entropy maximization
— This work deals with a group of mobile sensors sampling a spatiotemporal random field whose mean is unknown and covariance is known up to a scaling parameter. The Bayesian pos...
Rishi Graham, Jorge Cortés
ISCAS
1999
IEEE
102views Hardware» more  ISCAS 1999»
14 years 1 months ago
Capacitor mismatch error cancellation technique for a successive approximation A/D converter
An error cancellation technique is described for suppressing capacitor mismatch in a successive approximation A/D converter. At the cost of a 50% increase in the conversion time, ...
Zhiliang Zheng, Un-Ku Moon, Jesper Steensgaard, Bo...
TSP
2008
103views more  TSP 2008»
13 years 9 months ago
Low-Rank Variance Approximation in GMRF Models: Single and Multiscale Approaches
Abstract--We present a versatile framework for tractable computation of approximate variances in large-scale Gaussian Markov random field estimation problems. In addition to its ef...
Dmitry M. Malioutov, Jason K. Johnson, Myung Jin C...