Sciweavers

1670 search results - page 205 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
ICCV
2007
IEEE
16 years 5 months ago
Finding a Closed Boundary by Growing Minimal Paths from a Single Point on 2D or 3D Images
In this paper, we present a new method for segmenting closed contours and surfaces. Our work builds on a variant of the Fast Marching algorithm. First, an initial point on the des...
Fethallah Benmansour, Stephane Bonneau, Laurent D....

Publication
363views
14 years 2 months ago
Detecting and Discriminating Behavioural Anomalies
This paper aims to address the problem of anomaly detection and discrimination in complex behaviours, where anomalies are subtle and difficult to detect owing to the complex tempor...
Chen Change Loy, Tao Xiang, Shaogang Gong
RTS
2008
74views more  RTS 2008»
15 years 2 months ago
Quantifying and suppressing the measurement disturbance in feedback controlled real-time systems
In the control of continuous and physical systems, the controlled system is sampled sufficiently fast to capture the dynamics of the system. In general, this property cannot be app...
Mehdi Amirijoo, Jörgen Hansson, Svante Gunnar...
EUROPAR
2001
Springer
15 years 7 months ago
Performance of High-Accuracy PDE Solvers on a Self-Optimizing NUMA Architecture
High-accuracy PDE solvers use multi-dimensional fast Fourier transforms. The FFTs exhibits a static and structured memory access pattern which results in a large amount of communic...
Sverker Holmgren, Dan Wallin
RT
2005
Springer
15 years 8 months ago
Radiance Cache Splatting: A GPU-Friendly Global Illumination Algorithm
Fast global illumination computation is a challenge in several fields such as lighting simulation and computergenerated visual effects for movies. To this end, the irradiance cac...
Pascal Gautron, Jaroslav Krivánek, Kadi Bou...