Sciweavers

1619 search results - page 163 / 324
» Structure in the Space of Value Functions
Sort
View
PVLDB
2010
103views more  PVLDB 2010»
15 years 4 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 1 months ago
Top-K Color Queries for Document Retrieval
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
Marek Karpinski, Yakov Nekrich
CORR
2010
Springer
174views Education» more  CORR 2010»
15 years 6 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor
ICML
2002
IEEE
16 years 7 months ago
Hierarchically Optimal Average Reward Reinforcement Learning
Two notions of optimality have been explored in previous work on hierarchical reinforcement learning (HRL): hierarchical optimality, or the optimal policy in the space defined by ...
Mohammad Ghavamzadeh, Sridhar Mahadevan
VLDB
2007
ACM
179views Database» more  VLDB 2007»
16 years 6 months ago
Mining Approximate Top-K Subspace Anomalies in Multi-Dimensional Time-Series Data
Market analysis is a representative data analysis process with many applications. In such an analysis, critical numerical measures, such as profit and sales, fluctuate over time a...
Xiaolei Li, Jiawei Han