Sciweavers

613 search results - page 66 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
GIS
2004
ACM
14 years 8 months ago
Discovering personal gazetteers: an interactive clustering approach
Personal gazetteers record individuals' most important places, such as home, work, grocery store, etc. Using personal gazetteers in location-aware applications offers additio...
Changqing Zhou, Dan Frankowski, Pamela J. Ludford,...
TALG
2010
86views more  TALG 2010»
13 years 6 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
COMPGEOM
1996
ACM
13 years 12 months ago
Developing a Practical Projection-Based Parallel Delaunay Algorithm
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
Guy E. Blelloch, Gary L. Miller, Dafna Talmor
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 5 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
SDM
2009
SIAM
180views Data Mining» more  SDM 2009»
14 years 4 months ago
Hierarchical Linear Discriminant Analysis for Beamforming.
This paper demonstrates the applicability of the recently proposed supervised dimension reduction, hierarchical linear discriminant analysis (h-LDA) to a well-known spatial locali...
Barry L. Drake, Haesun Park, Jaegul Choo