Sciweavers

2036 search results - page 58 / 408
» From Sampling to Model Counting
Sort
View
CGF
2008
134views more  CGF 2008»
15 years 1 months ago
Sample Based Visibility for Soft Shadows using Alias-free Shadow Maps
This paper introduces an accurate real-time soft shadow algorithm that uses sample based visibility. Initially, we present a GPU-based alias-free hard shadow map algorithm that ty...
Erik Sintorn, Elmar Eisemann, Ulf Assarsson
INFOCOM
2010
IEEE
14 years 11 months ago
Two Samples are Enough: Opportunistic Flow-level Latency Estimation using NetFlow
—The inherent support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problems where the ...
Myungjin Lee, Nick G. Duffield, Ramana Rao Kompell...
TOG
2010
134views more  TOG 2010»
14 years 8 months ago
Unbiased, adaptive stochastic sampling for rendering inhomogeneous participating media
Realistic rendering of participating media is one of the major subjects in computer graphics. Monte Carlo techniques are widely used for realistic rendering because they provide u...
Yonghao Yue, Kei Iwasaki, Bing-Yu Chen, Yoshinori ...
ICRA
1995
IEEE
188views Robotics» more  ICRA 1995»
15 years 4 months ago
Fast Approximation of Range Images by Triangular Meshes Generated through Adaptive Randomized Sampling
This paper describes and evaluates an efficient technique that allows the fast generation of 3D triangular meshes from range images avoiding optimization procedures. Such a tool ...
Miguel Angel García
FOCM
2008
156views more  FOCM 2008»
15 years 1 months ago
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
Stefan Kunis, Holger Rauhut