Sciweavers

30 search results - page 3 / 6
» Filtering Algorithms and Implementation for Very Fast Publis...
Sort
View
SIGMOD
2007
ACM
159views Database» more  SIGMOD 2007»
14 years 6 months ago
Boosting topic-based publish-subscribe systems with dynamic clustering
We consider in this paper a class of Publish-Subscribe (pub-sub) systems called topic-based systems, where users subscribe to topics and are notified on events that belong to thos...
Tova Milo, Tal Zur, Elad Verbin
FP
1989
124views Formal Methods» more  FP 1989»
13 years 10 months ago
Deriving the Fast Fourier Algorithm by Calculation
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
Geraint Jones
SIGIR
2009
ACM
14 years 15 days ago
Fast nonparametric matrix factorization for large-scale collaborative filtering
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
Kai Yu, Shenghuo Zhu, John D. Lafferty, Yihong Gon...
ICPR
2000
IEEE
14 years 7 months ago
Fast and Accurate Motion Estimation Using Orientation Tensors and Parametric Motion Models
Motion estimation in image sequences is an important step in many computer vision and image processing applications. Several methods for solving this problem have been proposed, b...
Gunnar Farnebäck
INFOCOM
2012
IEEE
11 years 8 months ago
The Variable-Increment Counting Bloom Filter
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy