Sciweavers

6251 search results - page 188 / 1251
» Randomness, Computability, and Density
Sort
View
CVPR
1998
IEEE
16 years 6 months ago
Markov Random Fields with Efficient Approximations
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
Yuri Boykov, Olga Veksler, Ramin Zabih
DATE
2007
IEEE
92views Hardware» more  DATE 2007»
15 years 10 months ago
Random sampling of moment graph: a stochastic Krylov-reduction algorithm
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
Zhenhai Zhu, Joel R. Phillips
COLCOM
2007
IEEE
15 years 5 months ago
A random projection approach to subscription covering detection in publish/subscribe systems
Abstract—Subscription covering detection is useful to improving the performance of any publish/subscribe system. However, an exact solution to querying coverings among a large se...
Duc A. Tran, Thinh Nguyen
135
Voted
FCS
2009
15 years 1 months ago
Spectral Analysis of Attractors in Random Boolean Network Models
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
Kenneth A. Hawick
CVPR
2012
IEEE
13 years 6 months ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee