Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 21 - 30
of
7,785
An Efficient k-Means Clustering Algorithm: Analysis and Implementation
, 2000
"... K-means clustering is a very popular clustering technique, which is used in numerous applications. Given a set of n data points in R d and an integer k, the problem is to determine a set of k points R d , called centers, so as to minimize the mean squared distance from each data point to its ..."
Abstract
-
Cited by 417 (4 self)
- Add to MetaCart
nearest center. A popular heuristic for k-means clustering is Lloyd's algorithm. In this paper we present a simple and efficient implementation of Lloyd's k-means clustering algorithm, which we call the filtering algorithm. This algorithm is very easy to implement. It differs from most other
A New Voronoi-Based Surface Reconstruction Algorithm
, 2002
"... We describe our experience with a new algorithm for the reconstruction of surfaces from unorganized sample points in R³. The algorithm is the first for this problem with provable guarantees. Given a “good sample” from a smooth surface, the output is guaranteed to be topologically correct and converg ..."
Abstract
-
Cited by 414 (9 self)
- Add to MetaCart
, rather than approximates, the input points. Our algorithm is based on the three-dimensional Voronoi diagram. Given a good program for this fundamental subroutine, the algorithm is quite easy to implement.
Equivariant Adaptive Source Separation
- IEEE Trans. on Signal Processing
, 1996
"... Source separation consists in recovering a set of independent signals when only mixtures with unknown coefficients are observed. This paper introduces a class of adaptive algorithms for source separation which implements an adaptive version of equivariant estimation and is henceforth called EASI (Eq ..."
Abstract
-
Cited by 449 (9 self)
- Add to MetaCart
Source separation consists in recovering a set of independent signals when only mixtures with unknown coefficients are observed. This paper introduces a class of adaptive algorithms for source separation which implements an adaptive version of equivariant estimation and is henceforth called EASI
Efficient randomized pattern-matching algorithms
, 1987
"... We present randomized algorithms to solve the
following string-matching problem and some of its generalizations: Given a string X of length n (the pattern) and a string Y (the text), find the first occurrence of X as a consecutive block within Y. The algorithms represent strings of length n by much ..."
Abstract
-
Cited by 397 (1 self)
- Add to MetaCart
by much shorter strings called fingerprints, and achieve their efficiency by manipulating fingerprints instead of longer strings. The algorithms require a constant number of storage locations, and essentially run in real time. They are conceptually simple and easy to implement. The method readily
A metric for distributions with applications to image databases
, 1998
"... We introduce a new distance between two distributions that we call the Earth Mover’s Distance (EMD), which reflects the minimal amount of work that must be performed to transform one distributioninto the other by moving “distribution mass ” around. This is a special case of the transportation proble ..."
Abstract
-
Cited by 438 (6 self)
- Add to MetaCart
problem from linear optimization, for which efficient algorithms are available. The EMD also allows for partial matching. When used to compare distributions that have the same overall mass, the EMD is a true metric, and has easy-to-compute lower bounds. In this paper we focus on applications to image
Direct least Square Fitting of Ellipses
, 1998
"... This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac - b² = 1 the new method incorporates the ellipticity constraint ..."
Abstract
-
Cited by 430 (3 self)
- Add to MetaCart
into the normalization factor. The proposed method combines several advantages: (i) It is ellipse-specific so that even bad data will always return an ellipse; (ii) It can be solved naturally by a generalized eigensystem and (iii) it is extremely robust, efficient and easy to implement.
Making Gnutella-like P2P Systems Scalable
, 2003
"... Napster pioneered the idea of peer-to-peer file sharing, and supported it with a centralized file search facility. Subsequent P2P systems like Gnutella adopted decentralized search algorithms. However, Gnutella's notoriously poor scaling led some to propose distributed hash table solutions to t ..."
Abstract
-
Cited by 429 (1 self)
- Add to MetaCart
implementation and its deployment on a testbed. Categories and Subject Descriptors C.2 [Computer Communication Networks]: Distributed Systems General Terms Algorithms, Design, Performance, Experimentation Keywords Peer-to-peer, distributed hash tables, Gnutella 1.
Image denoising by sparse 3D transform-domain collaborative filtering
- IEEE TRANS. IMAGE PROCESS
, 2007
"... We propose a novel image denoising strategy based on an enhanced sparse representation in transform domain. The enhancement of the sparsity is achieved by grouping similar 2-D image fragments (e.g., blocks) into 3-D data arrays which we call “groups.” Collaborative filtering is a special procedure d ..."
Abstract
-
Cited by 424 (32 self)
- Add to MetaCart
efficient implementation are presented in full detail; an extension to color-image denoising is also developed. The experimental results demonstrate that this computationally scalable algorithm achieves state-of-the-art denoising performance in terms of both peak signal-to-noise ratio and subjective visual
Pricing continuous Asian options: a comparison of Monte Carlo and Laplace transform inversion methods
- Journal of Computational Finance
, 1998
"... In this paper, we investigate two numerical methods for pricing Asian options: Laplace transform inversion and Monte Carlo simulation. In attempting to numerically invert the Laplace transform of the Asian call option that has been derived previously in the literature, we point out some of the poten ..."
Abstract
-
Cited by 47 (3 self)
- Add to MetaCart
of the potential difficulties inherent in this approach. We investigate the effectiveness of two easy-to-implement algorithms, which not only provide a cross-check for accuracy, but also demonstrate superior precision to two alternatives proposed in the literature for the Asian pricing problem. We then extend
The slider-pinning problem
- CCCG
, 2007
"... A Laman mechanism is a flexible planar bar-and-joint framework with m ≤ 2n − 3 edges and exactly k = 2n − m degrees of freedom. The slider-pinning problem is to eliminate all the degrees of freedom of a Laman mechanism, in an optimal fashion, by individually fixing x or y coordinates of vertices. We ..."
Abstract
-
Cited by 384 (7 self)
- Add to MetaCart
. We describe two easy to implement O(n²) time algorithms.
Results 21 - 30
of
7,785
