Sciweavers

257 search results - page 22 / 52
» Learning Unions of Tree Patterns Using Queries
Sort
View
ECML
2006
Springer
15 years 1 months ago
Approximate Policy Iteration for Closed-Loop Learning of Visual Tasks
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...
Sébastien Jodogne, Cyril Briquet, Justus H....
SEMWEB
2007
Springer
15 years 3 months ago
Learning Subsumption Relations with CSR: a Classification based Method for the Alignment of Ontologies
In this paper we propose the "Classification-Based Learning of Subsumption Relations for the Alignment of Ontologies" (CSR) method. Given a pair of concepts from two onto...
Vassilis Spiliopoulos, Alexandros G. Valarakos, Ge...
CVPR
2007
IEEE
15 years 11 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
15 years 9 months ago
Identifying Similarities, Periodicities and Bursts for Online Search Queries
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
CONCUR
2006
Springer
14 years 11 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson