Optimal Matching and Deterministic Sampling

Optimal Matching and Deterministic Sampling (2007)

Cached

Download Links

[www.cs.drexel.edu]

by Jeff Abrahamson

BibTeX

@MISC{Abrahamson07optimalmatching,
    author = {Jeff Abrahamson},
    title = {Optimal Matching and Deterministic Sampling},
    year = {2007}
}

Bookmark

OpenURL

Abstract

Citations

7321	Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
4404	The Mathematical Theory of Communication - Shannon, Weaver - 1963
1577	An Introduction to Probability Theory and Its Applications Volume I. 3rd edition - Feller - 1968
773	A method for the construction of minimum-redundancy codes - Huffman - 1952
759	Information Theory, Inference and Learning Algorithms - Mackay - 2003
584	Artihmetic coding for data compression - Witten, Neal, et al. - 1987
533	Approximate nearest neighbors: Towards removing the curse of dimensionality - Indyk, Motwani - 1998
493	Fibonacci heaps and their uses in improved network optimization algorithms - Fredman, Tarjan - 1987
457	An n 5/2 algorithm for maximum matchings in bipartite graphs - Hopcroft, Karp - 1973
413	Introduction to the Theory of Computation - Sipser - 1997
330	The Information Bottleneck Method - Tishby, Pereira, et al. - 1999
301	The Earth Mover’s Distance as a Metric for Image Retrieval - Rubner, Tomasi, et al. - 2000
291	Probabilistic approximations of metric spaces and its algorithmic applications - Bartal - 1996
222	On approximating arbitrary metrices by tree metrics - Bartal - 1998
222	Probability and Random Processes - Grimmett - 1992
194	Integral Geometry and Geometric Probability - Santaló - 2004
141	Trans-dichotomous algorithms for minimum spanning trees and shortest paths - Fredman, Willard - 1990
128	A Locally Adaptive Data Compression Scheme - Bentley, Sleator, et al. - 1986
106	An o( \|V \|\|E\|) algorithm for finding maximum matching in general graphs - Micali, Vazirani - 1980
99	On sets of distances of n points - Erdős - 1970
99	Transmission of Information: A Statistical Theory of Communication - Fano - 1961
98	Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes, Combinatorica 6 - Hart, Sharir - 1986
96	A deterministic view of random sampling and its use in geometry, Combinatorica 10 - Chazelle, Friedman - 1990
96	A faster strongly polynomial minimum cost flow algorithm, Oper Res 41 - Orlin - 1993
84	Ashu Rege: ”A Digital Fountain Approach to Reliable Distribution of Bulk Data - Byers, Luby, et al. - 1998
82	Congruence, Similarity and Symmetries of Geometric Objects - Alt, Mehlhorn, et al. - 1988
81	Data compression - Lelewer, Hirschberg - 1987
81	Mémoire sur la théorie des déblais et de remblais, Histoire de l'Académie Royale des Sciences de - MONGE - 1993
78	Introduction to Geometric Probability - Klein, Rota - 1997
77	A replacement for Voronoi diagrams of near linear size - Har-Peled - 2001
76	Shape matching: similarity measures and algorithms - Veltkamp
75	A Remark on Stirling’s Formula - Robbins - 1955
71	A 2003 Encyclopedia of Integer Sequences, available electronically at http://www.research.att.com/˜njas/sequences - Sloane
70	Proofs from - Aigner, Ziegler - 1998
69	Efficient algorithms for finding minimum spanning trees in undirected and directed graphs - Gabow, Rarjan - 1986
66	On the history of the minimum spanning tree problem - Hell, Graham - 1985
63	Finding minimum spanning trees - Cheriton, Tarjan - 1976
59	A minimum spanning tree algorithm with inverse-ackermann type complexity - Chazelle
57	Continuous selections - Michael - 1956
52	The earth movers distance is the mallows distance: some insights from statistics - Levina, Bickel
46	Partial differential equations and Monge-Kantorovich mass transfer, in Current developments in mathematics - EVANS - 1997
46	The Monge-Kantorovich mass transference problem and its stochastic applications - Rachev - 1985
42	Note on Hamilton circuits - Ore - 1960
39	Extracting randomness via repeated condensing - Reingold, Shaltiel, et al. - 2000
37	Matching shapes with a reference point - Alt, Aichholzer, et al. - 1994
37	On the translocation of masses - Kantorovich - 1942
37	Introduction to Circuit Complexity. A Uniform Approach - Vollmer - 1999
36	Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics - Fakcharoenphol, Rao
36	Geometric matching under noise: Combinatorial bounds and algorithms - Indyk, Motwani, et al. - 1999
35	The Earth Mover‟s Distance under Transformation - Cohen, Guibas - 1999