Sciweavers

779 search results - page 134 / 156
» Ranking distributed probabilistic data
Sort
View
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 2 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 5 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
ICCV
2005
IEEE
14 years 11 months ago
Integration of Conditionally Dependent Object Features for Robust Figure/Background Segmentation
We propose a new technique for fusing multiple cues to robustly segment an object from its background in video sequences that suffer from abrupt changes of both illumination and p...
Francesc Moreno-Noguer, Alberto Sanfeliu, Dimitris...
ICIP
2008
IEEE
14 years 11 months ago
Variational Bayesian image processing on stochastic factor graphs
In this paper, we present a patch-based variational Bayesian framework of image processing using the language of factor graphs (FGs). The variable and factor nodes of FGs represen...
Xin Li
ICML
2000
IEEE
14 years 10 months ago
Maximum Entropy Markov Models for Information Extraction and Segmentation
Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many text-related tasks, such as part-of-speech t...
Andrew McCallum, Dayne Freitag, Fernando C. N. Per...