Sciweavers

5154 search results - page 223 / 1031
» Computing and using residuals in time series models
Sort
View
SC
2000
ACM
15 years 11 months ago
Automatically Tuned Collective Communications
The performance of the MPI’s collective communications is critical in most MPI-based applications. A general algorithm for a given collective communication operation may not giv...
Sathish S. Vadhiyar, Graham E. Fagg, Jack Dongarra
EGH
2003
Springer
16 years 15 days ago
CULLIDE: interactive collision detection between complex models in large environments using graphics hardware
We present a novel approach for fast collision detection between multiple deformable and breakable objects in a large environment using graphics hardware. Our algorithm takes into...
Naga K. Govindaraju, Stephane Redon, Ming C. Lin, ...
CVPR
2004
IEEE
16 years 9 months ago
Model-Based Motion Clustering Using Boosted Mixture Modeling
Model-based clustering of motion trajectories can be posed as the problem of learning an underlying mixture density function whose components correspond to motion classes with dif...
Vladimir Pavlovic
JCDCG
2004
Springer
16 years 19 days ago
Farthest-Point Queries with Geometric and Combinatorial Constraints
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexande...
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 7 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...