Sciweavers

201 search results - page 11 / 41
» Incremental Algorithms for Approximate Compilation
Sort
View
ML
2002
ACM
154views Machine Learning» more  ML 2002»
14 years 9 months ago
Technical Update: Least-Squares Temporal Difference Learning
TD() is a popular family of algorithms for approximate policy evaluation in large MDPs. TD() works by incrementally updating the value function after each observed transition. It h...
Justin A. Boyan
FGR
2006
IEEE
255views Biometrics» more  FGR 2006»
15 years 1 months ago
Incremental Kernel SVD for Face Recognition with Image Sets
Non-linear subspaces derived using kernel methods have been found to be superior compared to linear subspaces in modeling or classification tasks of several visual phenomena. Such...
Tat-Jun Chin, Konrad Schindler, David Suter
ESWS
2009
Springer
15 years 4 months ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
SEMWEB
2010
Springer
14 years 7 months ago
Combining Approximation and Relaxation in Semantic Web Path Queries
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
Alexandra Poulovassilis, Peter T. Wood
AUTOMATICA
2008
154views more  AUTOMATICA 2008»
14 years 9 months ago
Approximately bisimilar symbolic models for nonlinear control systems
Control systems are usually modeled by differential equations describing how physical phenomena can be influenced by certain control parameters or inputs. Although these models ar...
Giordano Pola, Antoine Girard, Paulo Tabuada