Sciweavers

3110 search results - page 437 / 622
» On the initialization of the DNMF algorithm
Sort
View
CGF
2008
134views more  CGF 2008»
15 years 6 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
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 6 months ago
Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems
A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior of a typical po...
Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
COR
2008
99views more  COR 2008»
15 years 6 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi
CGF
2006
106views more  CGF 2006»
15 years 6 months ago
Silhouette Extraction in Hough Space
Object-space silhouette extraction is an important problem in fields ranging from non-photorealistic computer graphics to medical robotics. We present an efficient silhouette extr...
Matt Olson, Hao Zhang 0002
FGCS
2006
119views more  FGCS 2006»
15 years 6 months ago
OpenMP versus MPI for PDE solvers based on regular sparse numerical operators
Tw o parallel programming models represented b y OpenMP and MPI are compared for PDE solvers based on regular sparse numerical operators. As a typical representative of such an app...
Markus Nordén, Sverker Holmgren, Michael Th...