Sciweavers

1806 search results - page 184 / 362
» Randomness and halting probabilities
Sort
View
106
Voted
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
15 years 10 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
118
Voted
ICC
2007
IEEE
120views Communications» more  ICC 2007»
15 years 10 months ago
On the Tails of the Distribution of the Sum of Lognormals
—Finding the distribution of the sum of lognormal We assume in this paper that the terms Yi are independent. The random variables is an important mathematical problem in probabil...
Sebastien S. Szyszkowicz, Halim Yanikomeroglu
MMM
2007
Springer
198views Multimedia» more  MMM 2007»
15 years 10 months ago
A Shape Distribution for Comparing 3D Models
This study developed a new shape-based 3D model descriptor based on the D2 shape descriptor developed by Osada, et al of Princeton University. Shape descriptors can be used to meas...
Levi C. Monteverde, Conrado R. Ruiz Jr., Zhiyong H...
113
Voted
SSDBM
2007
IEEE
104views Database» more  SSDBM 2007»
15 years 10 months ago
Reservoir Sampling over Memory-Limited Stream Joins
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
Mohammed Al-Kateb, Byung Suk Lee, Xiaoyang Sean Wa...
95
Voted
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
15 years 9 months ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan