Sciweavers

348 search results - page 30 / 70
» Using Curvature Information for Fast Stochastic Search
Sort
View
SIGIR
2011
ACM
14 years 14 days ago
Fast context-aware recommendations with factorization machines
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
Steffen Rendle, Zeno Gantner, Christoph Freudentha...
LATIN
2010
Springer
15 years 4 months ago
Layered Working-Set Trees
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
SIPS
2007
IEEE
15 years 3 months ago
A Fast Mode Decision Algorithm for H.264/AVC Intra Prediction
In this paper, we present a fast mode decision algorithm for H.264/AVC intra prediction. The goal of this work is to reduce computational complexity of the H.264 encoder without s...
Ling-Jiao Pan, Yo-Sung Ho
ICIP
2009
IEEE
15 years 10 months ago
Integral P-channels For Fast And Robust Region Matching
We present a new method for matching a region between an input and a query image, based on the P-channel representation of pixel-based image features such as grayscale and color i...
SPIRE
2005
Springer
15 years 3 months ago
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
Ricardo A. Baeza-Yates, Alejandro Salinger