Sciweavers

501 search results - page 59 / 101
» Kernel Nearest Neighbor Algorithm
Sort
View
VISUALIZATION
1999
IEEE
13 years 12 months ago
Spiraling Edge: Fast Surface Reconstruction from Partially Organized Sample Points
Many applications produce three-dimensional points that must be further processed to generate a surface. Surface reconstruction algorithms that start with a set of unorganized poi...
Patricia Crossno, Edward Angel
VTC
2007
IEEE
117views Communications» more  VTC 2007»
14 years 1 months ago
Distributed Iterative Detection in an Interference Limited Cellular Network
—This paper presents a novel strategy for interference mitigation in an uplink of high reuse cellular networks through distributive processing. It is proposed that the neighborin...
Shahid Khattak, Gerhard Fettweis
NN
2008
Springer
201views Neural Networks» more  NN 2008»
13 years 7 months ago
Learning representations for object classification using multi-stage optimal component analysis
Learning data representations is a fundamental challenge in modeling neural processes and plays an important role in applications such as object recognition. In multi-stage Optima...
Yiming Wu, Xiuwen Liu, Washington Mio
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
13 years 9 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...
PAMI
2006
134views more  PAMI 2006»
13 years 7 months ago
A Genetic Algorithm Using Hyper-Quadtrees for Low-Dimensional K-means Clustering
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
Michael Laszlo, Sumitra Mukherjee