Sciweavers

16430 search results - page 697 / 3286
» On Computable Tree Functions
Sort
View
234
Voted
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 9 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
BIRTHDAY
2010
Springer
16 years 2 days ago
The Arrow of Time through the Lens of Computing
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
Krishna V. Palem
169
Voted
ECML
2007
Springer
16 years 1 months ago
Transfer Learning in Reinforcement Learning Problems Through Partial Policy Recycling
In this paper we investigate the relation between transfer learning in reinforcement learning with function approximation and supervised learning with concept drift. We present a n...
Jan Ramon, Kurt Driessens, Tom Croonenborghs
180
Voted
TIME
2005
IEEE
16 years 26 days ago
An XML-Based Framework for Temporal Database Implementation
This paper presents an XML-based approach to implementing the parametric model of temporal databases. In the parametric model, attribute values are functions of time and the entir...
Seo-Young Noh, Shashi K. Gadia
XIMEP
2005
ACM
126views Database» more  XIMEP 2005»
16 years 25 days ago
Purely Relational FLWORs
We report on a compilation procedure that derives relational algebra plans from arbitrarily nested XQuery FLWOR blocks. While recent research was able to develop relational encodi...
Torsten Grust