Sciweavers

1024 search results - page 80 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
CORR
2007
Springer
151views Education» more  CORR 2007»
14 years 10 months ago
Distributed spatial multiplexing with 1-bit feedback
— We analyze the feasibility of distributed spatial multiplexing with limited feedback in a slow-fading interference network with MN non-cooperating single-antenna sources and M ...
J. Thukral, Helmut Bölcskei
PR
2007
100views more  PR 2007»
14 years 9 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
Robert M. Haralick, Rave Harpaz
SDM
2007
SIAM
184views Data Mining» more  SDM 2007»
14 years 11 months ago
Mining Naturally Smooth Evolution of Clusters from Dynamic Data
Many clustering algorithms have been proposed to partition a set of static data points into groups. In this paper, we consider an evolutionary clustering problem where the input d...
Yi Wang, Shi-Xia Liu, Jianhua Feng, Lizhu Zhou
GECCO
2007
Springer
159views Optimization» more  GECCO 2007»
15 years 4 months ago
Objective fitness correlation
This paper introduces the Objective Fitness Correlation, a new tool to analyze the evaluation accuracy of coevolutionary algorithms. Accurate evaluation is an essential ingredient...
Edwin D. de Jong
IACR
2011
141views more  IACR 2011»
13 years 9 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger