Sciweavers

161 search results - page 16 / 33
» Learning Finite Automata Using Label Queries
Sort
View
SIGIR
2009
ACM
14 years 1 months ago
Extracting structured information from user queries with semi-supervised conditional random fields
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...
Xiao Li, Ye-Yi Wang, Alex Acero
LICS
2007
IEEE
14 years 1 months ago
Alternation-free modal mu-calculus for data trees
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 ...
Marcin Jurdzinski, Ranko Lazic
CLEF
2007
Springer
14 years 1 months ago
Simple Morpheme Labelling in Unsupervised Morpheme Analysis
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...
Delphine Bernhard
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
14 years 2 months ago
Generating labels from clicks
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...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
CRV
2009
IEEE
158views Robotics» more  CRV 2009»
14 years 2 months ago
Automated Spatial-Semantic Modeling with Applications to Place Labeling and Informed Search
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...
Pooja Viswanathan, David Meger, Tristram Southey, ...