Sciweavers

502 search results - page 94 / 101
» Streaming Random Forests
Sort
View
LISA
2000
13 years 11 months ago
Tracing Anonymous Packets to Their Approximate Source
Most denial-of-service attacks are characterized by a flood of packets with random, apparently valid source addresses. These addresses are spoofed, created by a malicious program ...
Hal Burch, Bill Cheswick
DKE
2008
109views more  DKE 2008»
13 years 10 months ago
Deterministic algorithms for sampling count data
Processing and extracting meaningful knowledge from count data is an important problem in data mining. The volume of data is increasing dramatically as the data is generated by da...
Hüseyin Akcan, Alex Astashyn, Hervé Br...
ICML
2003
IEEE
14 years 10 months ago
Online Ranking/Collaborative Filtering Using the Perceptron Algorithm
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
Edward F. Harrington
WWW
2005
ACM
14 years 10 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
P2P
2008
IEEE
124views Communications» more  P2P 2008»
14 years 4 months ago
A Bandwidth-Aware Scheduling Strategy for P2P-TV Systems
P2P-TV systems distribute live streaming contents by organizing the information flow in small chunks that are exchanged among peers. Different strategies can be implemented at th...
Ana Paula Couto da Silva, Emilio Leonardi, Marco M...