4208 search results - page 437 / 842 » Challenges in Evaluating Distributed Algorithms |
139
click to vote
CIKM
1997
Springer
15 years 8 months ago
1997
Springer
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
130
click to vote
ANOR
2010
15 years 2 months ago
2010
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
125
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
111
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Traditionally, collaborative filtering (CF) algorithms used for recommendation operate on complete knowledge. This makes these algorithms hard to employ in a decentralized contex...
132
click to vote
ICA
2007
Springer
15 years 10 months ago
2007
Springer
We present a robust algorithm for independent component analysis that uses the sum of marginal quadratic negentropies as a dependence measure. It can handle arbitrary source densit...