Sciweavers

5329 search results - page 429 / 1066
» The Weighted Majority Algorithm
Sort
View
180
Voted
FSS
2002
99views more  FSS 2002»
15 years 6 months ago
Extreme physical information and objective function in fuzzy clustering
Fuzzy clustering algorithms have been widely studied and applied in a variety of areas. They become the major techniques7 in cluster analysis. In this paper, we focus on objective...
Michel Ménard, Michel Eboueya
193
Voted
JMIV
2002
74views more  JMIV 2002»
15 years 6 months ago
A Filter To Remove Gaussian Noise by Clustering the Gray Scale
An algorithm to suppress Gaussian noise is presented, based on clustering (grouping) gray levels. The histogram of a window sliding across the image is divided into clusters, and t...
Zakaria Atae-Allah, José-Martínez Ar...
192
Voted
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 8 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta
MP
2002
143views more  MP 2002»
15 years 6 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck
158
Voted
ORL
1998
116views more  ORL 1998»
15 years 6 months ago
Heuristic solution of the multisource Weber problem as a p-median problem
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Pierre Hansen, Nenad Mladenovic, Éric D. Ta...