Sciweavers

2600 search results - page 41 / 520
» Clustering with or without the Approximation
Sort
View
SIGCOMM
2006
ACM
14 years 1 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
ICIP
2000
IEEE
14 years 9 months ago
Distributional Clustering for Efficient Content-Based Retrieval of Images and Video
In this paper, we presentan approach to clustering images for efficient retrieval using relative entropy. We start with the assumption that visual features are represented by prob...
Giridharan Iyengar, Andrew Lippman
COLT
2003
Springer
14 years 29 days ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
NIPS
2008
13 years 9 months ago
Clustering via LP-based Stabilities
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
Nikos Komodakis, Nikos Paragios, Georgios Tziritas
CLUSTER
2003
IEEE
14 years 1 months ago
From Clusters to the Fabric: The Job Management Perspective
Clusters provide an outstanding cost/performance ratio, but their efficient orchestration, i.e. their cooperative management, maintenance, and use, still poses difficulties. Mor...
Thomas Röblitz, Florian Schintke, Alexander R...