1333 search results - page 112 / 267 » Not a Number of Floating Point Problems |
133
Voted
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
The problem of feature-based surface reconstruction is considered in this paper. Our main contribution is the ability to handle visibility constraints, obtained from the projectio...
115
Voted
ICPR
2006
IEEE
16 years 4 months ago
2006
IEEE
We set out an object localization scheme based on a convex programming matching method. The proposed approach is designed to match general objects, especially objects with very li...
121
click to vote
CEC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— Designing efficient algorithms for difficult multiobjective optimization problems is a very challenging problem. In this paper a new clustering multi-objective evolut...
128
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
120
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...