3641 search results - page 427 / 729 » On Computability of Pattern Recognition Problems |
151
click to vote
ISAAC
2003
Springer
15 years 9 months ago
2003
Springer
In this paper some of the most fundamental problems in computational biology are proved intractable. The following problems are shown NP-hard for all binary or larger alphabets und...
137
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
Generalized Belief Propagation (gbp) has proven to be a promising technique for performing inference on Markov random fields (mrfs). However, its heavy computational cost and large...
125
click to vote
TSP
2010
14 years 11 months ago
2010
We consider the problem of recursively and causally reconstructing time sequences of sparse signals (with unknown and time-varying sparsity patterns) from a limited number of noisy...
145
click to vote
CIVR
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we develop a system to classify the outputs of image segmentation algorithms as perceptually relevant or perceptually irrelevant with respect to human perception. T...
136
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
In this paper, we address the problem of learning when some cases are fully labeled while other cases are only partially labeled, in the form of partial labels. Partial labels are...