Sciweavers

1539 search results - page 56 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
ICRA
2010
IEEE
107views Robotics» more  ICRA 2010»
15 years 28 days ago
Fast resolution of hierarchized inverse kinematics with inequality constraints
— Classically, the inverse kinematics is performed by computing the singular value decomposition of the matrix to invert. This enables a very simple writing of the algorithm. How...
Adrien Escande, Nicolas Mansard, Pierre-Brice Wieb...
CCGRID
2005
IEEE
15 years 8 months ago
Fast pattern-based throughput prediction for TCP bulk transfers
The ability to quickly predict the throughput of a TCP transfer between a client and a server, or between peers, has wide application in scientific computing and commercial compu...
Tsung-i Huang, Jaspal Subhlok
128
Voted
CAD
2007
Springer
15 years 2 months ago
Generating strictly non-self-overlapping structured quadrilateral grids
In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region...
Hongwei Lin, Kai Tang, Ajay Joneja, Hujun Bao
93
Voted
SCALESPACE
2007
Springer
15 years 8 months ago
Combining Different Types of Scale Space Interest Points Using Canonical Sets
Scale space interest points capture important photometric and deep structure information of an image. The information content of such points can be made explicit using image recons...
Frans Kanters, Trip Denton, Ali Shokoufandeh, Luc ...
ICPR
2000
IEEE
16 years 3 months ago
Fast and Accurate Motion Estimation Using Orientation Tensors and Parametric Motion Models
Motion estimation in image sequences is an important step in many computer vision and image processing applications. Several methods for solving this problem have been proposed, b...
Gunnar Farnebäck