Sciweavers

13603 search results - page 126 / 2721
» On the Complexity of Computing Treelength
Sort
View
CORR
2012
Springer
281views Education» more  CORR 2012»
12 years 5 months ago
Belief Propagation by Message Passing in Junction Trees: Computing Each Message Faster Using GPU Parallelization
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
Lu Zheng, Ole J. Mengshoel, Jike Chong
TON
2002
138views more  TON 2002»
13 years 9 months ago
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
João L. Sobrinho
CIKM
2010
Springer
13 years 7 months ago
Computing the top-k maximal answers in a join of ranked lists
Complex search tasks that utilize information from several data sources, are answered by integrating the results of distinct basic search queries. In such integration, each basic ...
Mirit Shalem, Yaron Kanza
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
13 years 7 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
SRDS
2010
IEEE
13 years 7 months ago
A Cooperative Sampling Approach to Discovering Optimal Configurations in Large Scale Computing Systems
With the growing scale of current computing systems, traditional configuration tuning methods become less effective because they usually assume a small number of parameters in the...
Haifeng Chen, Guofei Jiang, Hui Zhang 0002, Kenji ...