2168 search results - page 115 / 434 » Randomized Algorithms and Complexity Theory |
134
click to vote
NIPS
2008
15 years 4 months ago
2008
Inspired by the hierarchical hidden Markov models (HHMM), we present the hierarchical semi-Markov conditional random field (HSCRF), a generalisation of embedded undirected Markov ...
125
click to vote
CLEF
2010
Springer
15 years 3 months ago
2010
Springer
Image classification or annotation is proved difficult for the computer algorithms. The Naive-Bayes Nearest Neighbor method is proposed to tackle the problem, and achieved the stat...
124
click to vote
TACAS
2010
Springer
15 years 1 months ago
2010
Springer
Software model checkers are being used mostly to discover specific types of errors in the code, since exhaustive verification of complex programs is not possible due to state explo...
104
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
In this paper, we present a novel approach to contentsbased image retrieval. The method hinges in the use of quasi-random sampling to retrieve those images in a database which are...
137
click to vote
STACS
2005
Springer
15 years 8 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...