| Document Date: 2013-04-15 22:52:04
Open Document File Size: 870,87 KBShare Result on Facebook
City New York / / Company Intel / / Country United States / / Currency pence / USD / Rs / / / Facility University of Utah / / IndustryTerm post-processing step / road network / distributed processing / important applications / greedy algorithm / complicated algorithm / road networks / data-intensive applications / data intensive applications / memory matching algorithm / theoretical algorithm / deterministic algorithm / streaming algorithm / large-scale data processing framework / web trace / randomized and deterministic algorithms / precision applications / data mining community / scientific computing / / OperatingSystem Linux / / Organization Feifei Li School of Computing / National Science Foundation / University of Utah / Salt Lake City / / Person max B / Memetracker / Yan Zheng / Jeff M. Phillips / Jeffrey Jestes / / Position MP / / Product MergeReduce / / ProgrammingLanguage C++ / / ProvinceOrState Alaska / Hawaii / New York / / Technology Grid-MR algorithm / memory matching algorithm / two-dimensional Grid-MR algorithm / following algorithm / following deterministic algorithm / matching algorithm / randomized and deterministic algorithms / theoretical algorithm / Linux / following greedy algorithm / quite complicated algorithm / Greedy-MR algorithms / two-dimensional algorithms / Blossom algorithm / Reduce Step The Blossom-MR algorithm / Grid algorithm / data mining / proposed algorithms / Grid matching algorithm / machine learning / MergeReduce algorithms / Grid-MR +RS algorithm / 2.1 The MergeReduce framework Our algorithm / Blossom-MR algorithm / 5.2 Randomized MergeReduce Algorithm / streaming algorithm / pdf / Blossom-MR+RS algorithm / MergeReduce algorithm / /
SocialTag |
Quality and Efficiency in Kernel Density Estimates for Large Data ∗ Yan Zheng, Jeffrey Jestes, Jeff M. Phillips, Feifei Li School of Computing, University of Utah, Salt Lake City, USA