Share This Author
An Efficient Targeting Strategy for Multiobject Spectrograph Surveys: the Sloan Digital Sky Survey “Tiling” Algorithm
Large surveys using multiobject spectrographs require automated methods for deciding how to efficiently point observations and how to assign targets to each pointing. The Sloan Digital Sky Survey…
Sequential and parallel algorithms for mixed packing and covering
- N. Young
- Computer ScienceProceedings IEEE International Conference on…
- 8 October 2001
The main contribution is that the algorithms solve mixed packing and covering problems (in contrast to pure packing or pure covering problems, which have only "/spl les/" or only "/ spl ges/" inequalities) and run in time independent of the so-called width of the problem.
Logical-shapelets: an expressive primitive for time series classification
- A. Mueen, Eamonn J. Keogh, N. Young
- Computer ScienceKnowledge Discovery and Data Mining
- 21 August 2011
This work introduces a novel algorithm that finds shapelets in less time than current methods by an order of magnitude, and shows for the first time an augmented shapelet representation that distinguishes the data based on conjunctions or disjunctions of shapelets.
Competitive Paging Algorithms
Balancing minimum spanning trees and shortest-path trees
- S. Khuller, B. Raghavachari, N. Young
- Computer ScienceACM-SIAM Symposium on Discrete Algorithms
- 1 October 1995
A simple algorithm to find a spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree is given and obtains the best-possible tradeoff.
On-Line File Caching
- N. Young
- Computer ScienceSODA '98
- 1 January 2002
A simple deterministic on-line algorithm that generalizes many well-known paging and weighted-caching strategies, including least-recently-used, first-in-first-out, flush-when-full, and the balance algorithm is given.
Randomized rounding without solving the linear program
- N. Young
- Computer Science, MathematicsACM-SIAM Symposium on Discrete Algorithms
- 22 January 1995
A new technique called oblivious rounding is introduced a variant of randomized rounding that avoids the bottleneck of first solving the linear program, which yields more efficient algorithms and brings probabilistic methods to bear on a new class of problems.
Rounding algorithms for a geometric embedding of minimum multiway cut
- David R Karger, P. Klein, C. Stein, M. Thorup, N. Young
- Computer ScienceSymposium on the Theory of Computing
- 1 May 1999
The lower bound shows that this is the best algorithm that finds a cut of value 12/11 times the relaxation value, and a family of graphs with integrality gaps so-called integrality gap of the relaxation is exhibited.
Faster parametric shortest path and minimum-balance algorithms
Experiments on random graphs suggest that the expected time for finding a minimum mean cycle with the algorithm is O(n log n + m) time, improved from O(nm log n) for the parametric shortest path algorithm of Karp and Orlin.
Approximating the minimum equivalent digraph
These results provide practical approximation algorithms for NP-hard network-design problems via an increased under- standing of connectivity properties via a modification that improves the performance guarantee.