Sciweavers

161 search results - page 13 / 33
» Learning Finite Automata Using Label Queries
Sort
View
WWW
2011
ACM
13 years 2 months ago
Learning to re-rank: query-dependent image re-ranking using click data
Our objective is to improve the performance of keyword based image search engines by re-ranking their baseline results. To this end, we address three limitations of existing searc...
Vidit Jain, Manik Varma
ICAC
2005
IEEE
14 years 1 months ago
PICCIL: Interactive Learning to Support Log File Categorization
Motivated by the real-world application of categorizing system log messages into defined situation categories, this paper describes an interactive text categorization method, PICC...
David Loewenstern, Sheng Ma, Abdi Salahshour
PODS
2010
ACM
213views Database» more  PODS 2010»
14 years 14 days ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
COLT
2006
Springer
13 years 11 months ago
Learning Rational Stochastic Languages
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
François Denis, Yann Esposito, Amaury Habra...
BC
2008
134views more  BC 2008»
13 years 7 months ago
Interacting with an artificial partner: modeling the role of emotional aspects
In this paper we introduce a simple model based on probabilistic finite state automata to describe an emotional interaction between a robot and a human user, or between simulated a...
Isabella Cattinelli, Massimiliano Goldwurm, N. Alb...