Sciweavers

357 search results - page 18 / 72
» Is Computational Complexity a Barrier to Manipulation
Sort
View
ICFP
2006
ACM
16 years 5 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross
JMM2
2007
113views more  JMM2 2007»
15 years 5 months ago
Shape Morphing of Complex Geometries Using Partial Differential Equations
— An alternative technique for shape morphing using a surface generating method using partial differential equations is outlined throughout this work. The boundaryvalue nature th...
Gabriela González Castro, Hassan Ugail
ICCV
2003
IEEE
16 years 7 months ago
Improved Fast Gauss Transform and Efficient Kernel Density Estimation
Evaluating sums of multivariate Gaussians is a common computational task in computer vision and pattern recognition, including in the general and powerful kernel density estimatio...
Changjiang Yang, Ramani Duraiswami, Nail A. Gumero...
BMCBI
2007
172views more  BMCBI 2007»
15 years 5 months ago
msBayes: Pipeline for testing comparative phylogeographic histories using hierarchical approximate Bayesian computation
Background: Although testing for simultaneous divergence (vicariance) across different population-pairs that span the same barrier to gene flow is of central importance to evoluti...
Michael J. Hickerson, Eli Stahl, Naoki Takebayashi
ICRA
1998
IEEE
110views Robotics» more  ICRA 1998»
15 years 10 months ago
Generating Robust Trajectories in the Presence of Ordinary and Linear-Self-Motion Singularities
An algorithm is presented which computes feasible manipulator trajectories along fixed paths in the presence of kinematic singularities. The resulting trajectories are close to mi...
John E. Lloyd, Vincent Hayward