Sciweavers

397 search results - page 6 / 80
» Geometrical plenoptic sampling
Sort
View
DM
2007
87views more  DM 2007»
13 years 10 months ago
Gaps in samples of geometric random variables
In this note we continue the study of gaps in samples of geometric random variables originated in Hitczenko and Knopfmacher [Gap-free compositions and gap-free samples of geometri...
William M. Y. Goh, Pawel Hitczenko
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
14 years 3 months ago
Weighted Geometric Set Cover via Quasi-Uniform Sampling
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
Kasturi Varadarajan
ALENEX
2004
92views Algorithms» more  ALENEX 2004»
14 years 8 days ago
Gap-Free Samples of Geometric Random Variables
We study the asymptotic probability that a random composition of an integer n is gap-free, that is, that the sizes of parts in the composition form an interval. We show that this ...
Pawel Hitczenko, Arnold Knopfmacher
PODS
2004
ACM
207views Database» more  PODS 2004»
14 years 11 months ago
Adaptive Sampling for Geometric Problems over Data Streams
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...
John Hershberger, Subhash Suri
IPPS
1998
IEEE
14 years 3 months ago
Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
David Hsu, Lydia E. Kavraki, Jean-Claude Latombe, ...