Back to Results
First PageMeta Content
Computing / R-tree / Segment tree / K-d tree / Measure / B-tree / Interval tree / Fractional cascading / Graph theory / Binary trees / Data management


CCCG 2011, Toronto ON, August 10–12, 2011 A Discrete and Dynamic Version of Klee’s Measure Problem Hakan Yıldız∗ John Hershberger†
Add to Reading List

Document Date: 2011-08-06 04:11:13

Open Document

File Size: 364,66 KB

Share Result on Facebook

Company

Mentor Graphics Corp. / /

/

Event

Reorganization / /

Facility

By building / University of California / /

IndustryTerm

static solution / data mining applications / faster algorithm / local area network / tree insertion algorithm / external services / range search / deletion algorithm / /

Organization

Department of Computer Science / Institut f¨ / Pittsburgh PA / University of California / Santa Barbara / /

Person

Subhash Suri / /

Position

Prime Minister / /

ProvinceOrState

California / /

PublishedMedium

American Mathematical Monthly / /

Technology

LAN / ESA / data mining / time algorithms / mining algorithms / same deletion algorithm / firewall / 3 tree insertion algorithm / /

SocialTag