Sciweavers

Share
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
9 years 10 months ago
Earth mover distance over high-dimensional spaces
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
Alexandr Andoni, Piotr Indyk, Robert Krauthgamer
SODA
2008
ACM
66views Algorithms» more  SODA 2008»
9 years 10 months ago
Embedding metric spaces in their intrinsic dimension
Ittai Abraham, Yair Bartal, Ofer Neiman
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
9 years 10 months ago
Distribution-sensitive point location in convex subdivisions
A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time t...
Sébastien Collette, Vida Dujmovic, John Iac...
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
9 years 10 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
9 years 10 months ago
Maximum overhang
Mike Paterson, Yuval Peres, Mikkel Thorup, Peter W...
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
9 years 10 months ago
Linked decompositions of networks and the power of choice in Polya urns
Henry C. Lin, Christos Amanatidis, Martha Sideri, ...
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
9 years 10 months ago
Tight lower bounds for selection in randomly ordered streams
Amit Chakrabarti, T. S. Jayram, Mihai Patrascu
SODA
2008
ACM
109views Algorithms» more  SODA 2008»
9 years 10 months ago
Auctions for structured procurement
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
Matthew Cary, Abraham D. Flaxman, Jason D. Hartlin...
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
9 years 10 months ago
On properties of random dissections and triangulations
In the past decades the Gn,p model of random graphs, introduced by Erdos and R
Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
9 years 10 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
books