2136 search results - page 10 / 428 » Improving on Expectation Propagation |
JACM
2010
13 years 7 months ago
2010
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...
ICDE
2005
IEEE
14 years 10 months ago
2005
IEEE
In peer-to-peer networks, indices are used to map data to nodes that host the data. The performance of data access can be improved by actively pushing indices to interested nodes....
ECSQARU
1999
Springer
14 years 27 days ago
1999
Springer
Abstract. Given several Dempster-Shafer belief functions, the framework of valuation networks describes an efficient method for computing the marginal of the combined belief functi...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
ICAI
2009
13 years 6 months ago
2009
Agents that operate in a real-world environment have to process an abundance of information, which may be ambiguous or noisy. We present a method inspired by cognitive research tha...