Back to Results
First PageMeta Content
K-d tree / VC dimension / Algorithm / Centerpoint / Ε-net / Data stream clustering / Geometry / Mathematics / Statistics


Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points ∗ Pankaj K. Agarwal† 1
Add to Reading List

Document Date: 2005-07-31 13:55:46

Open Document

File Size: 78,36 KB

Share Result on Facebook

City

Las Vegas / Urbana / Pasadena / London / /

Company

Cambridge University Press / Honda Corporation / /

Country

United States / Netherlands / /

/

Facility

Duke University / Stanford Networking Research Center / Stanford University / University of Illinois / /

IndustryTerm

approximate algorithms / database systems / randomized algorithm / off-line algorithms / deterministic algorithm / space-efficient algorithm / approximation algorithms / /

Organization

Cambridge University / University of Illinois / Okawa Foundation / National Science Foundation / Department of Computer Science / Carnegie-Mellon Univ. / U.S.-Israeli Binational Science Foundation / Stanford University / Organisation for Scientific Research / Center for the Mathematics of Information / Stanford Networking Research Center / Duke University / Durham / /

Person

Pankaj K. Agarwal / /

Product

CCR / /

ProvinceOrState

Manitoba / Illinois / North Carolina / California / /

PublishedMedium

Theoretical Computer Science / /

SportsLeague

Stanford University / /

Technology

randomized algorithm / HeapSweep algorithm / approximate algorithms / S. Faster off-line algorithms / deterministic algorithm / Las Vegas algorithm / approximation algorithms / J. Algorithms / 4 References Approximation Algorithms / /

SocialTag