Sciweavers

218 search results - page 41 / 44
» Probabilistic shadow information spaces
Sort
View
WWW
2009
ACM
14 years 8 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
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
14 years 24 days ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
ASPLOS
2006
ACM
14 years 1 months ago
Bell: bit-encoding online memory leak detection
Memory leaks compromise availability and security by crippling performance and crashing programs. Leaks are difficult to diagnose because they have no immediate symptoms. Online ...
Michael D. Bond, Kathryn S. McKinley
NIPS
2003
13 years 8 months ago
Max-Margin Markov Networks
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...
Benjamin Taskar, Carlos Guestrin, Daphne Koller
MOBICOM
2005
ACM
14 years 29 days ago
Abiding geocast: time--stable geocast for ad hoc networks
Abiding geocast is a time stable geocast delivered to all nodes that are inside a destination region within a certain period of time. Services like position–based advertising, p...
Christian Maihöfer, Tim Leinmüller, Elma...