Sciweavers

JCP
2006
117views more  JCP 2006»
13 years 9 months ago
Empirical Analysis of Attribute-Aware Recommender System Algorithms Using Synthetic Data
As the amount of online shoppers grows rapidly, the need of recommender systems for e-commerce sites are demanding, especially when the number of users and products being offered o...
Karen H. L. Tso, Lars Schmidt-Thieme
JCP
2006
100views more  JCP 2006»
13 years 9 months ago
A Local Enumeration Protocol in Spite of Corrupted Data
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] p...
Brahim Hamid, Mohamed Mosbah
DISOPT
2007
155views more  DISOPT 2007»
13 years 9 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin
JCM
2006
78views more  JCM 2006»
13 years 9 months ago
Computationally-Efficient DNLMS-Based Adaptive Algorithms for Echo Cancellation Application
This paper investigates the application of the delayed normalized least mean square (DNLMS) algorithm to echo cancellation. In order to reduce the amount of computations, DNLMS is ...
Raymond Lee, Esam Abdel-Raheem, Mohammed A. S. Kha...
JSAT
2008
85views more  JSAT 2008»
13 years 9 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren
CVIU
2007
128views more  CVIU 2007»
13 years 9 months ago
Iterative relative fuzzy connectedness for multiple objects with multiple seeds
In this paper we present a new theory and an algorithm for image segmentation based on a strength of connectedness between every pair of image elements. The object definition use...
Krzysztof Ciesielski, Jayaram K. Udupa, Punam K. S...
JAL
2006
101views more  JAL 2006»
13 years 9 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...
JACM
2006
93views more  JACM 2006»
13 years 9 months ago
Combining expert advice in reactive environments
"Experts algorithms" constitute a methodology for choosing actions repeatedly, when the rewards depend both on the choice of action and on the unknown current state of t...
Daniela Pucci de Farias, Nimrod Megiddo
JACM
2006
98views more  JACM 2006»
13 years 9 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
JACM
2006
112views more  JACM 2006»
13 years 9 months ago
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Juha Kärkkäinen, Peter Sanders, Stefan B...