Sciweavers

6943 search results - page 543 / 1389
» Representations for evolutionary algorithms
Sort
View
ICIP
1999
IEEE
16 years 8 months ago
A Fast Algorithm for Rigid Structure from Image Sequences
The factorization method [1] is a feature-based approach to recover 3D rigid structure from motion. In [2], we extended their framework to recover a parametric description of the ...
Pedro M. Q. Aguiar, José M. F. Moura
MMM
2006
Springer
154views Multimedia» more  MMM 2006»
16 years 1 months ago
A robust object shape prediction algorithm in the presence of white Gaussian noise
This paper presents a shape prediction algorithm in a noisy video sequence based on pixel representation in the undecimated wavelet domain. In our algorithm for tracking of user-d...
Mohammad Khansari, Hamid R. Rabiee, M. Asadi, M. G...
CP
1998
Springer
15 years 11 months ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
15 years 10 months ago
Incremental algorithms for collision detection between solid models
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
16 years 21 days ago
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
Hao Yuan, Linji Yang, Erdong Chen