161 search results - page 16 / 33 » Learning Finite Automata Using Label Queries |
185
click to vote
SIGIR
2009
ACM
16 years 11 days ago
2009
ACM
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
170
click to vote
LICS
2007
IEEE
16 years 4 days ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
158
click to vote
CLEF
2007
Springer
16 years 1 days ago
2007
Springer
This paper presents my participation to the second Morpho Challenge. Results have been obtained with the algorithm already presented at Morpho Challenge 2005. The system takes a p...
173
click to vote
WSDM
2009
ACM
16 years 19 days ago
2009
ACM
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
177
click to vote
CRV
2009
IEEE
16 years 18 days ago
2009
IEEE
This paper presents a spatial-semantic modeling system featuring automated learning of object-place relations from an online annotated database, and the application of these relat...