Sciweavers

13476 search results - page 77 / 2696
» Learning from Streams
Sort
View
106
Voted
COCOON
2005
Springer
15 years 8 months ago
Finding Longest Increasing and Common Subsequences in Streaming Data
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...
David Liben-Nowell, Erik Vee, An Zhu
157
Voted
APPROX
2004
Springer
108views Algorithms» more  APPROX 2004»
15 years 8 months ago
Estimating Frequency Moments of Data Streams Using Random Linear Combinations
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
Sumit Ganguly
132
Voted
SIGGRAPH
1999
ACM
15 years 7 months ago
Deep Compression for Streaming Texture Intensive Animations
This paper presents a streaming technique for synthetic texture intensive 3D animation sequences. There is a short latency time while downloading the animation, until an initial f...
Daniel Cohen-Or, Yair Mann, Shachar Fleishman
112
Voted
ASPDAC
2004
ACM
96views Hardware» more  ASPDAC 2004»
15 years 6 months ago
Rate analysis for streaming applications with on-chip buffer constraints
While mapping a streaming (such as multimedia or network packet processing) application onto a specified architecture, an important issue is to determine the input stream rates tha...
Alexander Maxiaguine, Simon Künzli, Samarjit ...
ICMCS
2010
IEEE
236views Multimedia» more  ICMCS 2010»
15 years 3 months ago
Practical algorithm for minimum delay peer-to-peer media streaming
Though the existence of a minimum delay peer-to-peer media streaming scheme has been shown (under the name of snowball streaming), no actual algorithm has ever been designed so fa...
Jun Luo