Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ALENEX
2001
89views Algorithms» more  ALENEX 2001»
12 years 3 months ago
Estimating Resemblance of MIDI Documents
Abstract. Search engines often employ techniques for determining syntactic similarity of Web pages. Such a tool allows them to avoid returning multiple copies of essentially the sa...
Michael Mitzenmacher, Sean Owen
ALENEX
2001
101views Algorithms» more  ALENEX 2001»
12 years 3 months ago
CNOP - A Package for Constrained Network Optimization
Abstract. We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications...
Kurt Mehlhorn, Mark Ziegelmann
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
12 years 3 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,...
ALENEX
2001
105views Algorithms» more  ALENEX 2001»
12 years 3 months ago
A Probabilistic Spell for the Curse of Dimensionality
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
Edgar Chávez, Gonzalo Navarro
ALENEX
2001
103views Algorithms» more  ALENEX 2001»
12 years 3 months ago
Travel Planning with Self-Made Maps
Speed-up techniques that exploit given node coordinates have proven useful for shortest-path computations in transportation networks and geographic information systems. To facilita...
Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thom...
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
12 years 3 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
books