Sciweavers

502 search results - page 34 / 101
» Streaming Random Forests
Sort
View
ESA
2007
Springer
121views Algorithms» more  ESA 2007»
14 years 4 months ago
Finding Frequent Elements in Non-bursty Streams
We present an algorithm for finding frequent elements in a stream where the arrivals are not bursty. Depending on the amount of burstiness in the stream our algorithm detects elem...
Rina Panigrahy, Dilys Thomas
ISM
2006
IEEE
253views Multimedia» more  ISM 2006»
14 years 4 months ago
Gossip Based Streaming with Incentives for Peer Collaboration
— Peer-to-peer (P2P) systems are becoming a popular means of streaming audio and video content but they are prone to bandwidth starvation if selfish peers do not contribute band...
Sachin Agarwal, Shruti Dube
IPPS
2005
IEEE
14 years 3 months ago
Stream PRAM
Parallel random access memory, or PRAM, is a now venerable model of parallel computation that that still retains its usefulness for the design and analysis of parallel algorithms....
Darrell R. Ulm, Michael Scherger
CVPR
2011
IEEE
13 years 5 months ago
Learning Context for Collective Activity Recognition
In this paper we present a framework for the recognition of collective human activities. A collective activity is defined or reinforced by the existence of coherent behavior of i...
Wongun Choi, Silvio Savarese, Khuram Shahid
INFOCOM
2007
IEEE
14 years 4 months ago
PRIME: Peer-to-Peer Receiver-drIven MEsh-Based Streaming
Abstract—The success of swarming content delivery has motivated a new approach to live Peer-to-Peer (P2P) streaming that we call mesh-based streaming. In this approach, participa...
Nazanin Magharei, Reza Rejaie