Sciweavers

5329 search results - page 178 / 1066
» The Weighted Majority Algorithm
Sort
View
JGAA
2000
179views more  JGAA 2000»
15 years 6 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
15 years 6 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
SMC
2010
IEEE
276views Control Systems» more  SMC 2010»
15 years 4 months ago
A Modified Invasive Weed Optimization Algorithm for training of feed- forward Neural Networks
— Invasive Weed Optimization Algorithm IWO) is an ecologically inspired metaheuristic that mimics the process of weeds colonization and distribution and is capable of solving mul...
Ritwik Giri, Aritra Chowdhury, Arnob Ghosh, Swagat...
CSIE
2009
IEEE
16 years 1 months ago
Evaluating Clustering Algorithms: Cluster Quality and Feature Selection in Content-Based Image Clustering
The paper presents an evaluation of four clustering algorithms: k-means, average linkage, complete linkage, and Ward’s method, with the latter three being different hierarchical...
Mesfin Sileshi, Björn Gambäck
WABI
2007
Springer
122views Bioinformatics» more  WABI 2007»
16 years 17 days ago
Algorithms for the Extraction of Synteny Blocks from Comparative Maps
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
Vicky Choi, Chunfang Zheng, Qian Zhu, David Sankof...