Sciweavers

1297 search results - page 24 / 260
» Refractor Importance Sampling
Sort
View
ICIP
2006
IEEE
14 years 9 months ago
Distributed Acquisition and Image Super-Resolution Based on Continuous Moments from Samples
Recently, new sampling schemes were presented for signals with finite rate of innovation (FRI) using sampling kernels reproducing polynomials or exponentials [1] [2]. In this pape...
Loïc Baboulaz, Pier Luigi Dragotti
VC
2008
93views more  VC 2008»
13 years 7 months ago
Efficient product sampling using hierarchical thresholding
Abstract We present an efficient method for importance sampling the product of multiple functions. Our algorithm computes a quick approximation of the product on-the-fly, based on ...
Fabrice Rousselle, Petrik Clarberg, Luc Leblanc, V...
FOCS
2006
IEEE
14 years 1 months ago
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
László Lovász, Santosh Vempal...
CAEPIA
2003
Springer
14 years 20 days ago
A Method to Adaptively Propagate the Set of Samples Used by Particle Filters
Abstract. In recent years, particle filters have emerged as a useful tool that enables the application of Bayesian reasoning to problems requiring dynamic state estimation. The ef...
Alvaro Soto
CAIP
2009
Springer
155views Image Analysis» more  CAIP 2009»
14 years 2 months ago
Algorithms for the Sample Mean of Graphs
Measures of central tendency for graphs are important for protoype construction, frequent substructure mining, and multiple alignment of protein structures. This contribution propo...
Brijnesh J. Jain, Klaus Obermayer