Sciweavers

827 search results - page 80 / 166
» The Complexity of Probabilistic Lobbying
Sort
View
ICDE
2011
IEEE
207views Database» more  ICDE 2011»
14 years 10 months ago
Monte Carlo query processing of uncertain multidimensional array data
— Array database systems are architected for scientific and engineering applications. In these applications, the value of a cell is often imprecise and uncertain. There are at le...
Tingjian Ge, David Grabiner, Stanley B. Zdonik
ISBI
2011
IEEE
14 years 10 months ago
Exact integration of diffusion orientation distribution functions for graph-based diffusion MRI analysis
Graph-based image analysis methods are increasingly being applied to diffusion MRI (dMRI) analysis. Unfortunately, weighting the graph for these methods involves solving a complex...
Brian G. Booth, Ghassan Hamarneh
AI
2011
Springer
14 years 10 months ago
Parallelizing a Convergent Approximate Inference Method
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
Ming Su, Elizabeth Thompson
AAAI
2011
14 years 6 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
ASUNAM
2011
IEEE
14 years 6 months ago
Multi-relational Link Prediction in Heterogeneous Information Networks
Abstract—Many important real-world systems, modeled naturally as complex networks, have heterogeneous interactions and complicated dependency structures. Link prediction in such ...
Darcy A. Davis, Ryan Lichtenwalter, Nitesh V. Chaw...