| Document Date: 2004-06-07 21:08:09
Open Document File Size: 186,35 KBShare Result on Facebook
City San Francisco / New York / Rome / Cambridge / Brooklyn / / Company Artificial Intelligence Laboratory / P LP / / Country Italy / United States / / Currency USD / / / Event FDA Phase / / IndustryTerm modified relativeerror algorithm / geometric algorithms / optimization algorithm / possible algorithm / adaptive algorithm / absolute-error algorithms / above yield adaptive relative-error algorithms / relative-error algorithms / absolute-minimum-finding algorithm / deterministic algorithms / relative-error algorithm / correct algorithm / binary search / adaptive algorithms / adaptive sorting algorithms / absolute-error algorithm / binary search taking / aggregation algorithms / numerical algorithms / trivial algorithm / non-adaptive algorithms / linear search / / Organization MIT / / Person Erik D. Demaine / / Position general black-box model / no algorithm can solve these problems / problems and computations General / / Product Cowon D2+ Portable Audio Device / Ellipse Lemma / J1 / / ProgrammingLanguage C / D / L / / ProvinceOrState New York / California / Massachusetts / / PublishedMedium Lecture Notes in Computer Science / / Technology correct algorithm / relative-error algorithm / adaptive sorting algorithms / absolute-error algorithms / above yield adaptive relative-error algorithms / non-adaptive algorithms / aggregation algorithms / trivial algorithm / optimally adaptive algorithm / Image Processing / relative-error algorithms / optimization algorithm / 3.3 Algorithm / absolute-minimum-finding algorithm / absolute-error algorithm / modified algorithm / modified relativeerror algorithm / adaptive algorithm / / URL http /
SocialTag |
Optimal Adaptive Algorithms for Finding the Nearest and Farthest Point on a Parametric Black-Box Curve Ilya Baran [removed] Erik D. Demaine