6274 search results - page 564 / 1255 » From query complexity to computational complexity |
225
click to vote
ICCV
2011
IEEE
14 years 7 months ago
2011
IEEE
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...
252
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Saliency estimation has become a valuable tool in image processing. Yet, existing approaches exhibit considerable variation in methodology, and it is often difficult to attribute...
326
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
205
click to vote
ALT
2004
Springer
16 years 4 months ago
2004
Springer
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
221
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...