Sciweavers

5169 search results - page 171 / 1034
» Locality approximation using time
Sort
View
SODA
2012
ACM
229views Algorithms» more  SODA 2012»
13 years 7 months ago
Approximation algorithms for stochastic orienteering
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath ...
FOCM
2008
100views more  FOCM 2008»
15 years 5 months ago
Meshfree Thinning of 3D Point Clouds
An efficient data reduction scheme for the simplification of a surface given by a large set X of 3D point-samples is proposed. The data reduction relies on a recursive point remov...
Nira Dyn, Armin Iske, Holger Wendland
ICCAD
2004
IEEE
107views Hardware» more  ICCAD 2004»
16 years 1 months ago
Computation of signal threshold crossing times directly from higher order moments
—This paper introduces a simple method for calculating the times at which any signal crosses a prespecified threshold voltage (e.g., 10%, 20%, 50%, etc.) directly from the moment...
Yehea I. Ismail, Chirayu S. Amin
UAI
2008
15 years 6 months ago
Continuous Time Dynamic Topic Models
In this paper, we develop the continuous time dynamic topic model (cDTM). The cDTM is a dynamic topic model that uses Brownian motion to model the latent topics through a sequenti...
Chong Wang, David M. Blei, David Heckerman
PODS
2005
ACM
115views Database» more  PODS 2005»
16 years 5 months ago
Histograms revisited: when are histograms the best approximation method for aggregates over joins?
The traditional statistical assumption for interpreting histograms and justifying approximate query processing methods based on them is that all elements in a bucket have the same...
Alin Dobra