Sciweavers

1182 search results - page 118 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
15 years 9 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
ICCV
1995
IEEE
15 years 6 months ago
Object Pose: Links Between Paraperspective and Perspective
Recently, Dementhon 0 Davis [2] proposed a method for determining the pose of a 3-0 object with respect to a camera from 3-D to 2-0 point correspondences. The method consists of i...
Radu Horaud, Stéphane Christy, Fadi Dornaik...
PRL
2006
139views more  PRL 2006»
15 years 3 months ago
Adaptive Hausdorff distances and dynamic clustering of symbolic interval data
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
Francisco de A. T. de Carvalho, Renata M. C. R. de...
HEURISTICS
2008
120views more  HEURISTICS 2008»
15 years 3 months ago
A local linear embedding module for evolutionary computation optimization
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
Fabio Boschetti
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
16 years 3 months ago
Extensible optimization in overlay dissemination trees
We introduce XPORT, a profile-driven distributed data dissemination system that supports an extensible set of data types, profile types, and optimization metrics. XPORT efficientl...
Olga Papaemmanouil, Yanif Ahmad, Ugur Çetin...