Back to Results
First PageMeta Content
Applied mathematics / Convex optimization / Linear programming / Constraint / Candidate solution / Algorithm / Linear programming relaxation / LP-type problem / Mathematical optimization / Operations research / Mathematics


Solving online feasibility problem in constant amortized time per update Lilian Buzer∗† global shape of the pixels by minimizing an approximation error. But, using digital primitives we can build an exact approximati
Add to Reading List

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


Open Document

File Size: 104,12 KB

Share Result on Facebook

Company

BP / A2SI Laboratory / /

Country

France / /

Currency

pence / /

/

IndustryTerm

Online Linear Programming / dimensional online algorithm / deterministic online and linear algorithm / feasible solution / greedy recognition algorithms / online version / search technique / online feasibility problem / twodimensional search problem / Linear-time algorithms / multidimensional search technique / online method / randomized and parallel algorithms / search problem / deterministic algorithm / online algorithm / recognition algorithms / feasible solutions / /

Person

Micha Sharir / Pankaj K. Agarwal / Lilian Buzer / Blaise Pascal / /

Product

Pentax K-x Digital Camera / /

PublishedMedium

Journal of the ACM / /

Technology

online algorithm / Megiddo algorithm / greedy recognition algorithms / randomized algorithm / 3-d / Linear-time algorithms / two-dimensional algorithm / deterministic online and linear algorithm / 3 Offline Megiddo algorithm / randomized and parallel algorithms / time algorithm / deterministic algorithm / Las Vegas algorithm / dimensional online algorithm / recognition algorithms / deterministic offline linear Megiddo algorithm / offline linear deterministic Megiddo algorithm / /

SocialTag