1628 search results - page 88 / 326 » Partitioning Sets with Genetic Algorithms |
150
click to vote
ICDM
2002
IEEE
15 years 9 months ago
2002
IEEE
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
132
click to vote
TVCG
2010
14 years 10 months ago
2010
Abstract--One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cacheaware (CA) and cache-oblivious (CO) algorithms take into...
144
click to vote
CICLING
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents two methods which automatically produce annotated corpora for text summarisation on the basis of human abstracts. Both methods identify a set of sentences from ...
JGT
2006
15 years 4 months ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
125
click to vote
HPCC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...