Sciweavers

464 search results - page 71 / 93
» On the Computational Complexity of Hierarchical Radiosity
Sort
View
CVPR
2010
IEEE
15 years 1 months ago
Scene understanding by statistical modeling of motion patterns
We present a novel method for the discovery and statistical representation of motion patterns in a scene observed by a static camera. Related methods involving learning of pattern...
Imran Saleemi, Lance Hartung, Mubarak Shah
CGF
2008
78views more  CGF 2008»
15 years 1 months ago
Single-pass Scalable Subsurface Rendering with Lightcuts
This paper presents a new, scalable, single pass algorithm for computing subsurface scattering using the diffusion approximation. Instead of pre-computing a globally conservative ...
Adam Arbree, Bruce Walter, Kavita Bala
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 1 months ago
On Equivalence Between Network Topologies
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
Michelle Effros, Tracey Ho, Shirin Jalali
CORR
2010
Springer
81views Education» more  CORR 2010»
14 years 8 months ago
Analysis of Agglomerative Clustering
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
Marcel R. Ackermann, Johannes Blömer, Daniel ...
SIAMSC
2011
85views more  SIAMSC 2011»
14 years 4 months ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss