1431 search results - page 52 / 287 » The complexity of random ordered structures |
CP
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
107
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
128
Voted
MICCAI
2010
Springer
14 years 11 months ago
2010
Springer
Due to the complex noise structure of functional magnetic resonance imaging (fMRI) data, methods that rely on information within a single subject often results in unsatisfactory fu...
110
Voted
AAAI
2011
14 years 16 days ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
277
click to vote
PAMI
2010
14 years 11 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...