688 search results - page 105 / 138 » General Partitioning on Random Graphs |
94
Voted
NIPS
2007
15 years 1 months ago
2007
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
116
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Multistage residual vector quantizers (RVQ) with optimal direct sum decoder codebooks have been successfully designed and implemented for data compression. Due to its multistage s...
119
Voted
ICCV
2005
IEEE
15 years 6 months ago
2005
IEEE
We propose a general method that parameterizes general surfaces with complex (possible branching) topology using Riemann surface structure. Rather than evolve the surface geometry...
AI
2007
Springer
15 years 18 days ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
117
Voted
STOC
2004
ACM
16 years 23 days ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...