Sciweavers

1689 search results - page 204 / 338
» Proximate point searching
Sort
View
ICPR
2002
IEEE
16 years 7 months ago
4-D Voting for Matching, Densification and Segmentation into Motion Layers
* We present a novel approach for grouping from motion, based on a 4-D Tensor Voting computational framework. From sparse point tokens in two frames we recover the dense velocity f...
Gérard G. Medioni, Mircea Nicolescu
MICCAI
2005
Springer
16 years 7 months ago
Shape Modeling Using Automatic Landmarking
Abstract. This paper describes a novel approach to automatically recover accurate correspondence over various shapes. In order to detect the features points with the capability in ...
Jun Xie, Pheng-Ann Heng
KDD
2001
ACM
164views Data Mining» more  KDD 2001»
16 years 6 months ago
Data mining criteria for tree-based regression and classification
This paper is concerned with the construction of regression and classification trees that are more adapted to data mining applications than conventional trees. To this end, we pro...
Andreas Buja, Yung-Seop Lee
CEC
2009
IEEE
16 years 1 months ago
A clustering multi-objective evolutionary algorithm based on orthogonal and uniform design
Abstract— Designing efficient algorithms for difficult multiobjective optimization problems is a very challenging problem. In this paper a new clustering multi-objective evolut...
Yuping Wang, Chuangyin Dang, Hecheng Li, Lixia Han...
CEC
2009
IEEE
16 years 1 months ago
Theoretical analysis of rank-based mutation - combining exploration and exploitation
— Parameter setting is an important issue in the design of evolutionary algorithms. Recently, experimental work has pointed out that it is often not useful to work with a fixed ...
Pietro Simone Oliveto, Per Kristian Lehre, Frank N...