Sciweavers

502 search results - page 56 / 101
» Streaming Random Forests
Sort
View
PRIS
2004
13 years 11 months ago
Similarity Range Queries in Streaming Time Series
Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...
Maria Kontaki, Apostolos Papadopoulos, Yannis Mano...
TPDS
2008
116views more  TPDS 2008»
13 years 9 months ago
A Dynamic Skip List-Based Overlay for On-Demand Media Streaming with VCR Interactions
Media distribution through application-layer overlay networks has received considerable attention recently, owing to its flexible and readily deployable nature. On-demand streaming...
Dan Wang, Jiangchuan Liu
ICMCS
2009
IEEE
96views Multimedia» more  ICMCS 2009»
13 years 7 months ago
Optimizing segment caching for peer-to-peer on-demand streaming
In peer-to-peer (P2P) on-demand streaming applications, multimedia content is divided into segments and peers can seek any segments for viewing at anytime. Since different segment...
Ho-Shing Tang, Shueng-Han Gary Chan, Haochao Li
ICC
2009
IEEE
111views Communications» more  ICC 2009»
14 years 4 months ago
Supporting VCR-Like Operations in Derivative Tree-Based P2P Streaming Systems
— Supporting user interactivity in peer-to-peer streaming systems is challenging. VCR-like operations, such as random seek, pause, fast forward and rewind, require timely P2P ove...
Tianyin Xu, Jianzhong Chen, Wenzhong Li, Sanglu Lu...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 4 months ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...