Sciweavers

126 search results - page 2 / 26
» Improving heuristic mini-max search by supervised learning
Sort
View
ICASSP
2011
IEEE
12 years 9 months ago
Exploiting query click logs for utterance domain detection in spoken language understanding
In this paper, we describe methods to exploit search queries mined from search engine query logs to improve domain detection in spoken language understanding. We propose extending...
Dilek Hakkani-Tür, Larry Heck, Gökhan T&...
ICCBR
2007
Springer
13 years 11 months ago
Using Cases Utility for Heuristic Planning Improvement
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue,...
Tomás de la Rosa, Angel García Olaya...
WWW
2005
ACM
14 years 6 months ago
Ranking definitions with supervised learning methods
This paper is concerned with the problem of definition search. Specifically, given a term, we are to retrieve definitional excerpts of the term and rank the extracted excerpts acc...
Jun Xu, Yunbo Cao, Hang Li, Min Zhao
SAT
2004
Springer
89views Hardware» more  SAT 2004»
13 years 10 months ago
Using Rewarding Mechanisms for Improving Branching Heuristics
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
Elsa Carvalho, João P. Marques Silva
CVPR
2012
IEEE
11 years 7 months ago
Weakly supervised structured output learning for semantic segmentation
We address the problem of weakly supervised semantic segmentation. The training images are labeled only by the classes they contain, not by their location in the image. On test im...
Alexander Vezhnevets, Vittorio Ferrari, Joachim M....