Sciweavers

2766 search results - page 177 / 554
» Algorithms for trigonometric polynomials
Sort
View
SPIRE
2009
Springer
15 years 11 months ago
Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems
Collaborative filtering (CF) shares information between users to provide each with recommendations. Previous work suggests using sketching techniques to handle massive data sets i...
Yoram Bachrach, Ralf Herbrich, Ely Porat
ISPAN
2005
IEEE
15 years 10 months ago
Distributed Algorithmic Mechanism Design for Scheduling on Unrelated Machines
In classical mechanism design setting the outcome of the mechanism is computed by a trusted central party. In this paper we consider distributed implementations in which the outco...
Thomas E. Carroll, Daniel Grosu
SODA
2004
ACM
146views Algorithms» more  SODA 2004»
15 years 5 months ago
Approximating the two-level facility location problem via a quasi-greedy approach
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
Jiawei Zhang
STOC
2002
ACM
91views Algorithms» more  STOC 2002»
16 years 4 months ago
New results on monotone dualization and generating hypergraph transversals
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...
Thomas Eiter, Georg Gottlob, Kazuhisa Makino
ICASSP
2008
IEEE
15 years 11 months ago
Worst- and average-case complexity of LLL lattice reduction in MIMO wireless systems
Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows to improve the performance of suboptimal detectors and t...
Joakim Jalden, Dominik Seethaler, Gerald Matz