Sciweavers

44 search results - page 3 / 9
» Implicit and explicit optimizations for stencil computations
Sort
View
CGF
2010
157views more  CGF 2010»
13 years 3 months ago
Non-iterative Second-order Approximation of Signed Distance Functions for Any Isosurface Representation
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
Vladimir Molchanov, Paul Rosenthal, Lars Linsen
ECCV
2010
Springer
13 years 8 months ago
Optimum Subspace Learning and Error Correction for Tensors
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into a low-dimensional structure plus unbounded but spa...
AAAI
1998
13 years 7 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
ICPR
2010
IEEE
14 years 1 months ago
Probabilistic Modeling of Dynamic Traffic Flow across Non-Overlapping Camera Views
In this paper, we propose a probabilistic method to model the dynamic traffic flow across nonoverlapping camera views. By assuming the transition time of object movement follows a...
Ching-Chun Huang, Wei-Chen Chiu, Sheng-Jyh Wang, J...
HPCN
1995
Springer
13 years 9 months ago
Exploiting high performance Fortran for computational fluid dynamics
Abstract. We discuss the High Performance Fortran data parallel programming language as an aid to software engineering and as a tool for exploiting High Performance Computing syste...
Kenneth A. Hawick, Geoffrey Fox