Sciweavers

349 search results - page 60 / 70
» Covering a Set of Points with a Minimum Number of Lines
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
14 years 2 months ago
Alternative techniques to solve hard multi-objective optimization problems
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
Ricardo Landa Becerra, Carlos A. Coello Coello, Al...
MSV
2007
13 years 9 months ago
Assessment of ARMAX Structure as a Global Model for Self-Refilling Steam Distillation Essential Oil Extraction System
Abstract - In this paper, an essential oil extraction system with self-refilling system is modeled based on inputoutput data collected from a dedicated acquisition system. The ARMA...
Mohd Hezri Fazalul Rahiman, Mohd Nasir Taib, Yusof...
FOCS
2009
IEEE
14 years 2 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
DASFAA
2010
IEEE
419views Database» more  DASFAA 2010»
14 years 2 months ago
Incremental Clustering for Trajectories
Trajectory clustering has played a crucial role in data analysis since it reveals underlying trends of moving objects. Due to their sequential nature, trajectory data are often rec...
Zhenhui Li, Jae-Gil Lee, Xiaolei Li, Jiawei Han