Sciweavers

5595 search results - page 172 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ICRA
2007
IEEE
126views Robotics» more  ICRA 2007»
15 years 11 months ago
Incremental Spectral Clustering and Its Application To Topological Mapping
Abstract— This paper presents a novel use of spectral clustering algorithms to support cases where the entries in the affinity matrix are costly to compute. The method is increm...
Christoffer Valgren, Tom Duckett, Achim J. Lilient...
ECCV
2008
Springer
16 years 7 months ago
Solving Image Registration Problems Using Interior Point Methods
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
Camillo J. Taylor, Arvind Bhusnurmath
STOC
1998
ACM
111views Algorithms» more  STOC 1998»
15 years 9 months ago
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Nathan Linial, Alex Samorodnitsky, Avi Wigderson
160
Voted
FSKD
2005
Springer
141views Fuzzy Logic» more  FSKD 2005»
15 years 10 months ago
Spatial Homogeneity-Based Fuzzy c-Means Algorithm for Image Segmentation
Abstract. A fuzzy c-means algorithm incorporating the notion of dominant colors and spatial homogeneity is proposed for the color clustering problem. The proposed algorithm extract...
Bo-Yeong Kang, Dae-Won Kim, Qing Li
TAMC
2007
Springer
15 years 11 months ago
Approximation Algorithms for 3D Orthogonal Knapsack
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf ...