Back to Results
First PageMeta Content
Sample size determination / Simple random sample / Random sample / Sample / Horvitz–Thompson estimator / Estimation theory / Balanced repeated replication / Statistical benchmarking / Statistics / Sampling / Stratified sampling


Sampling Time-Based Sliding Windows in Bounded Space Rainer Gemulla Wolfgang Lehner Technische Universität Dresden
Add to Reading List

Document Date: 2014-09-29 11:40:17

Open Document

File Size: 473,62 KB

Share Result on Facebook

City

Vancouver / Dresden / Sampling Time / /

Company

Intel / /

Country

Germany / Canada / /

Currency

USD / /

/

IndustryTerm

approximate merge-based algorithm / web servers / data mining / dynamic programming algorithm / above algorithm / optimum solution / approximate solutions / search engine / memory management / relational database systems / per-item processing time / /

OperatingSystem

Microsoft Windows / /

Organization

Bounded Space Rainer Gemulla Wolfgang Lehner Technische Universität Dresden / Germany Technische Universität Dresden / /

Person

Nl / /

Position

Germany gemulla@inf.tu-dresden.de lehner@inf.tu-dresden.de ABSTRACT General / /

Product

Pentax K-x Digital Camera / /

ProvinceOrState

British Columbia / /

Technology

2 The algorithms / approximate merge-based algorithm / above algorithm / Java / 4 processor / relational database / Sliding Windows / data mining / dynamic programming algorithm / search engine / PDF / BPS algorithm / /

SocialTag