Sciweavers

1382 search results - page 184 / 277
» Formal Analysis of Online Algorithms
Sort
View
HPDC
2005
IEEE
16 years 10 hour ago
Interest-aware information dissemination in small-world communities
Information dissemination is a fundamental and frequently occuring problem in large, dynamic, distributed systems. We propose a novel approach to this problem, interest-aware info...
Adriana Iamnitchi, Ian T. Foster
COLT
1992
Springer
15 years 10 months ago
Learning Switching Concepts
We consider learning in situations where the function used to classify examples may switch back and forth between a small number of different concepts during the course of learnin...
Avrim Blum, Prasad Chalasani
NIPS
2008
15 years 7 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari
ACSW
2004
15 years 7 months ago
Cost-Efficient Mining Techniques for Data Streams
A data stream is a continuous and high-speed flow of data items. High speed refers to the phenomenon that the data rate is high relative to the computational power. The increasing...
Mohamed Medhat Gaber, Shonali Krishnaswamy, Arkady...
ICISC
2004
169views Cryptology» more  ICISC 2004»
15 years 7 months ago
ADWICE - Anomaly Detection with Real-Time Incremental Clustering
Abstract. Anomaly detection, detection of deviations from what is considered normal, is an important complement to misuse detection based on attack signatures. Anomaly detection in...
Kalle Burbeck, Simin Nadjm-Tehrani