Sciweavers

333 search results - page 14 / 67
» Optimal sampling from distributed streams
Sort
View
ALT
2008
Springer
14 years 5 months ago
Active Learning in Multi-armed Bandits
In this paper we consider the problem of actively learning the mean values of distributions associated with a finite number of options (arms). The algorithms can select which opti...
András Antos, Varun Grover, Csaba Szepesv&a...
VLDB
2004
ACM
112views Database» more  VLDB 2004»
14 years 9 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
SIGMETRICS
2012
ACM
257views Hardware» more  SIGMETRICS 2012»
11 years 11 months ago
Fair sampling across network flow measurements
Sampling is crucial for controlling resource consumption by internet traffic flow measurements. Routers use Packet Sampled NetFlow [9], and completed flow records are sampled in...
Nick G. Duffield
INFORMATICALT
2008
196views more  INFORMATICALT 2008»
13 years 8 months ago
An Efficient and Sensitive Decision Tree Approach to Mining Concept-Drifting Data Streams
Abstract. Data stream mining has become a novel research topic of growing interest in knowledge discovery. Most proposed algorithms for data stream mining assume that each data blo...
Cheng-Jung Tsai, Chien-I Lee, Wei-Pang Yang
ESA
2004
Springer
166views Algorithms» more  ESA 2004»
14 years 2 months ago
Super Scalar Sample Sort
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...
Peter Sanders, Sebastian Winkel