Sciweavers

7978 search results - page 847 / 1596
» Combining shared-coin algorithms
Sort
View
AAIM
2008
Springer
208views Algorithms» more  AAIM 2008»
15 years 9 months ago
Large-Scale Parallel Collaborative Filtering for the Netflix Prize
Many recommendation systems suggest items to users by utilizing the techniques of collaborative filtering (CF) based on historical records of items that the users have viewed, purc...
Yunhong Zhou, Dennis M. Wilkinson, Robert Schreibe...
ATAL
2008
Springer
15 years 9 months ago
Synthesis of strategies from interaction traces
We describe how to take a set of interaction traces produced by different pairs of players in a two-player repeated game, and combine them into a composite strategy. We provide an...
Tsz-Chiu Au, Sarit Kraus, Dana S. Nau
ARITH
2005
IEEE
15 years 9 months ago
Quasi-Pipelined Hash Circuits
Hash functions are an important cryptographic primitive. They are used to obtain a fixed-size fingerprint, or hash value, of an arbitrary long message. We focus particularly on ...
Marco Macchetti, Luigi Dadda
DAGM
2008
Springer
15 years 9 months ago
Space-Time Multi-Resolution Banded Graph-Cut for Fast Segmentation
Abstract. Applying real-time segmentation is a major issue when processing every frame of image sequences. In this paper, we propose a modification of the well known graph-cut algo...
Tobi Vaudrey, Daniel Gruber, Andreas Wedel, Jens K...
CCCG
2007
15 years 9 months ago
Generalized Watchman Route Problem with Discrete View Cost
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta