Back to Results
First PageMeta Content
NP-complete problems / Algorithm / Mathematical logic / Computational geometry / Numerical software / PROPT / Mathematics / Applied mathematics / Theoretical computer science


CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Maximum-Weight Planar Boxes in O(n2 ) Time (and Better) J´er´emy Barbay∗ Timothy M. Chan†
Add to Reading List

Document Date: 2013-08-11 21:51:56


Open Document

File Size: 351,28 KB

Share Result on Facebook

City

Mideplan / Valpara´ıso / Waterloo / /

Country

Canada / Chile / /

Currency

pence / /

/

Facility

University of Waterloo / University of Chile / /

IndustryTerm

direct solution / faster algorithm / divide-and-conquer algorithm / adaptive algorithms / adaptive algorithm / worst-case time algorithms / data mining / linear-time algorithm / mining / worst-case time algorithm / /

Organization

University of Chile / Department of Computer Science / Cheriton School of Computer Science / Sixteen Midwest Artificial Intelligence / University of Waterloo / /

Person

Gonzalo Navarro‡ Pablo / /

ProvinceOrState

Ontario / /

Technology

RAM / worst-case time algorithm / time algorithm / worst-case time algorithms / J. Algorithms / data mining / time algorithms / machine learning / linear-time algorithm / adaptive algorithm / divide-and-conquer algorithm / /

SocialTag