6413 search results - page 1091 / 1283 » Classes of cycle bases |
210
click to vote
NIPS
2008
15 years 8 months ago
2008
This paper addresses the important tradeoff between privacy and learnability, when designing algorithms for learning from private databases. We focus on privacy-preserving logisti...
163
click to vote
OPODIS
2008
15 years 8 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
172
click to vote
SIROCCO
2008
15 years 8 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
179
click to vote
SOCRATES
2008
15 years 8 months ago
2008
This study investigated the extent to which the social constructivist approach can be applied to the teaching/learning of translation strategies in an e-learning environment. To a...
155
click to vote
NIPS
2007
15 years 8 months ago
2007
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...