Sciweavers

886 search results - page 158 / 178
» On the Autoreducibility of Random Sequences
Sort
View
NOMS
2006
IEEE
169views Communications» more  NOMS 2006»
14 years 1 months ago
Real-Time Measurement of End-to-End Available Bandwidth using Kalman Filtering
—This paper presents a new method, BART (Bandwidth Available in Real-Time), for estimating the end-toend available bandwidth over a network path. It estimates bandwidth quasi-con...
Svante Ekelin, Martin Nilsson, Erik Hartikainen, A...
MIR
2006
ACM
267views Multimedia» more  MIR 2006»
14 years 1 months ago
Matching slides to presentation videos using SIFT and scene background matching
We present a general approach for automatically matching electronic slides to videos of corresponding presentations for use in distance learning and video proceedings of conferenc...
Quanfu Fan, Kobus Barnard, Arnon Amir, Alon Efrat,...
SBIA
2004
Springer
14 years 1 months ago
Learning with Drift Detection
Abstract. Most of the work in machine learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Pedro Medas, Gladys Castillo, Pe...
FUN
2010
Springer
233views Algorithms» more  FUN 2010»
14 years 14 days ago
The Complexity of Flood Filling Games
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
David Arthur, Raphaël Clifford, Markus Jalsen...
COMPGEOM
1992
ACM
13 years 11 months ago
On-Line Steiner Trees in the Euclidean Plane
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
Noga Alon, Yossi Azar