Sciweavers

2489 search results - page 11 / 498
» On the Subgroup Distance Problem
Sort
View
APWEB
2006
Springer
13 years 11 months ago
Generalized Projected Clustering in High-Dimensional Data Streams
Clustering is to identify densely populated subgroups in data, while correlation analysis is to find the dependency between the attributes of the data set. In this paper, we combin...
Ting Wang
CAINE
2003
13 years 8 months ago
A Genetic Algorithm for Clustering on Very Large Data Sets
Clustering is the process of subdividing an input data set into a desired number of subgroups so that members of the same subgroup are similar and members of different subgroups h...
Jim Gasvoda, Qin Ding
ANTS
2010
Springer
252views Algorithms» more  ANTS 2010»
13 years 11 months ago
On a Problem of Hajdu and Tengely
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ï...
Samir Siksek, Michael Stoll
ICAPR
2001
Springer
13 years 12 months ago
Grouping via the Matching of Repeated Patterns
Abstract. In this contribution, a novel and robust, geometry-based grouping strategy is proposed. Repeated, planar patterns in special relative positions are detected. The grouping...
Andreas Turina, Tinne Tuytelaars, Theo Moons, Luc ...
ICCV
2011
IEEE
12 years 6 months ago
Correspondence Free Registration through a Point-to-Model Distance Minimization
This paper presents a novel formulation, which derives in a smooth minimization problem, to tackle the rigid registration between a given point set and a model set. Unlike most of ...
Mohammad Rouhani and Angel D. Sappa