Sciweavers

320 search results - page 23 / 64
» Rigorous Result for the CHKNS Random Graph Model
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 9 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
SPRINGSIM
2010
15 years 4 months ago
Using factored bond graphs for distributed diagnosis of physical systems
This paper presents a distributed Bayesian fault diagnosis scheme for physical systems. Our diagnoser design is based on a procedure for factoring the global system bond graph (BG...
Indranil Roychoudhury, Gautam Biswas, Xenofon D. K...
ECCV
2008
Springer
16 years 7 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
CVPR
2007
IEEE
16 years 8 months ago
An MRF and Gaussian Curvature Based Shape Representation for Shape Matching
Matching and registration of shapes is a key issue in Computer Vision, Pattern Recognition, and Medical Image Analysis. This paper presents a shape representation framework based ...
Pengdong Xiao, Nick Barnes, Tibério S. Caet...