Sciweavers

5595 search results - page 350 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ALT
2008
Springer
16 years 3 months ago
Exploiting Cluster-Structure to Predict the Labeling of a Graph
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
Mark Herbster
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
16 years 8 days ago
RABNET: a real-valued antibody network for data clustering
This paper proposes a novel constructive learning algorithm for a competitive neural network. The proposed algorithm is developed by taking ideas from the immune system and demons...
Helder Knidel, Leandro Nunes de Castro, Fernando J...
PODS
2004
ACM
143views Database» more  PODS 2004»
16 years 6 months ago
Approximate Counts and Quantiles over Sliding Windows
We consider the problem of maintaining approximate counts and quantiles over fixed- and variablesize sliding windows in limited space. For quantiles, we present deterministic algo...
Arvind Arasu, Gurmeet Singh Manku
SECURWARE
2008
IEEE
16 years 1 months ago
Polynomial Heuristic Algorithms for Inconsistency Characterization in Firewall Rule Sets
Firewalls provide the first line of defence of nearly all networked institutions today. However, Firewall ACLs could have inconsistencies, allowing traffic that should be denied o...
Sergio Pozo Hidalgo, Rafael Ceballos, Rafael M. Ga...
COMPGEOM
2007
ACM
15 years 10 months ago
Bi-criteria linear-time approximations for generalized k-mean/median/center
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev