397 search results - page 5 / 80 » Geometrical plenoptic sampling |
INFOCOM
2011
IEEE
13 years 2 months ago
2011
IEEE
Abstract—Traffic monitoring and estimation of flow parameters in high speed routers have recently become challenging as the Internet grew in both scale and complexity. In this ...
COMGEO
2012
ACM
12 years 6 months ago
2012
ACM
The problem of reconstructing a region from a set of sample points is common in many geometric applications, including computer vision. It is very helpful to be able to guarantee ...
ICIP
2010
IEEE
13 years 8 months ago
2010
IEEE
Sets of multi-view images that capture plenoptic information from different viewpoints are typically related by geometric constraints. The proper analysis of these constraints is ...
COMPGEOM
2004
ACM
14 years 4 months ago
2004
ACM
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...
SAC
2011
ACM
13 years 1 months ago
2011
ACM
Slice sampling provides an easily implemented method for constructing a Markov chain Monte Carlo (MCMC) algorithm. However, slice sampling has two major drawbacks: (i) it requires...