Sciweavers

5889 search results - page 1022 / 1178
» Graph Layout Problems
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Scalable robust hypothesis tests using graphical models
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
Divyanshu Vats, Vishal Monga, Umamahesh Srinivas, ...
AAAI
2011
13 years 10 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
CP
2011
Springer
13 years 10 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
135
Voted
WSDM
2012
ACM
352views Data Mining» more  WSDM 2012»
13 years 5 months ago
Multi-relational matrix factorization using bayesian personalized ranking for social network data
A key element of the social networks on the internet such as Facebook and Flickr is that they encourage users to create connections between themselves, other users and objects. On...
Artus Krohn-Grimberghe, Lucas Drumond, Christoph F...
87
Voted
TON
2012
13 years 15 days ago
On New Approaches of Assessing Network Vulnerability: Hardness and Approximation
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
Thang N. Dinh, Ying Xuan, My T. Thai, Panos M. Par...
« Prev « First page 1022 / 1178 Last » Next »