Sciweavers

4488 search results - page 99 / 898
» Properties of NP-Complete Sets
Sort
View
CAINE
2003
13 years 9 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
TEC
2010
77views more  TEC 2010»
13 years 2 months ago
On Set-Based Multiobjective Optimization
Abstract--Assuming that evolutionary multiobjective optimization (EMO) mainly deals with set problems, one can identify three core questions in this area of research: (i) how to fo...
Eckart Zitzler, Lothar Thiele, Johannes Bader
ICCV
2001
IEEE
14 years 10 months ago
Feature Selection from Huge Feature Sets
The number of features that can be computed over an image is, for practical purposes, limitless. Unfortunately, the number of features that can be computed and exploited by most c...
José Bins, Bruce A. Draper
ICML
2000
IEEE
14 years 9 months ago
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Paul Komarek, Andrew W. Moore
ISAAC
2005
Springer
97views Algorithms» more  ISAAC 2005»
14 years 1 months ago
A Min-Max Relation on Packing Feedback Vertex Sets
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang