5606 search results - page 215 / 1122 » Randomization Techniques for Graphs. |
158
Voted
CVPR
2011
IEEE
14 years 9 months ago
2011
IEEE
This paper presents an algorithm for order reduction of
factors in High-Order Markov Random Fields (HOMRFs).
Standard techniques for transforming arbitrary high-order
factors in...
101
Voted
INFOCOM
2011
IEEE
14 years 4 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
113
Voted
INCDM
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Clustering algorithms for multidimensional numerical data must overcome special difficulties due to the irregularities of data distribution. We present a clustering algo...
104
click to vote
CP
2006
Springer
15 years 4 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
110
click to vote
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper shows how to improve Hidden Conditional Random Fields (HCRFs) for phone classification by applying various speaker adaptation techniques. These include Maximum A Poste...