Sciweavers

6110 search results - page 817 / 1222
» Approximate Computing
Sort
View
WWW
2009
ACM
16 years 7 months ago
Matchbox: large scale online bayesian recommendations
We present a probabilistic model for generating personalised recommendations of items to users of a web service. The Matchbox system makes use of content information in the form o...
David H. Stern, Ralf Herbrich, Thore Graepel
PODC
2009
ACM
16 years 7 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
16 years 7 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram
CEC
2009
IEEE
16 years 1 months ago
Enhancing MOEA/D with guided mutation and priority update for multi-objective optimization
—Multi-objective optimization is an essential and challenging topic in the domains of engineering and computation because real-world problems usually include several conflicting...
Chih-Ming Chen, Ying-Ping Chen, Qingfu Zhang
178
Voted
ADHOCNETS
2009
Springer
16 years 1 months ago
Improved Topology Control Algorithms for Simple Mobile Networks
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...
Fei Che, Errol L. Lloyd, Liang Zhao