1845 search results - page 170 / 369 » Machine-Learning Applications of Algorithmic Randomness |
131
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
117
click to vote
BMCBI
2007
15 years 1 months ago
2007
Background: In proteomic analysis, MS/MS spectra acquired by mass spectrometer are assigned to peptides by database searching algorithms such as SEQUEST. The assignations of pepti...
103
click to vote
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
163
Voted
ICPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
173
Voted
CVPR
2011
IEEE
14 years 10 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...