Back to Results
First PageMeta Content
Search algorithms / Analysis of algorithms / K-nearest neighbor algorithm / Time complexity / Pi / Algorithm / Nearest neighbor search / Euclidean algorithm / Theoretical computer science / Mathematics / Applied mathematics


Online Discovery of Top-k Similar Motifs in Time Series Data Hoang Thanh Lam1 , Ninh Dang Pham2 and Toon Calders1 1 Department of Math. and Computer Science
Add to Reading List

Document Date: 2011-01-23 17:47:59


Open Document

File Size: 775,10 KB

Share Result on Facebook

Company

oMotif First / /

Country

Netherlands / Vietnam / /

Currency

pence / /

/

Event

Product Issues / Product Recall / /

Facility

STL library / University of Technology Ho Chi Minh City / /

IndustryTerm

space-efficient algorithms / heuristic search / online top-k motifs discovery / online topk / query processing / spaceefficient algorithms / tractable exact motif discovery algorithm / large-scale applications / online decision / online motif discovery entire window / real applications / eral real applications / naive algorithm / complicated algorithm / sensor-networks / real time / kMotif algorithm / online applications / disk-aware algorithm / then ing several algorithms / trivial algorithm / space-efficient algorithm / online compression / scribes possible applications / insect time series management / largescale applications / data mining task / online motif discovery problem / nMotif algorithm / sensor network / /

OperatingSystem

Microsoft Windows / /

Organization

University of Technology Ho Chi Minh City / Department of Math / /

Person

Figure / /

Position

rt / forward / wb / /

Product

distance computation / Distribution of promising / /

ProgrammingLanguage

C++ / /

Technology

telemedicine / RAM / 5.1 Algorithm / spaceefficient algorithms / t-1 / disk-aware algorithm / nMotif algorithm / sliding windows / trivial algorithm / motif discovery algorithm / naive algorithm / data mining / kMotif algorithm / two algorithms / /

URL

http /

SocialTag