115 search results - page 6 / 23 » Versioning Tree Structures by Path-Merging |
COCOON
1999
Springer
14 years 2 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
SIGMOD
1996
ACM
14 years 1 months ago
1996
ACM
Detecting and representing changes to data is important for active databases, data warehousing, view maintenance, and version and configuration management. Most previous work in c...
ICML
2006
IEEE
14 years 10 months ago
2006
IEEE
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
— We use statistical estimates of the entropy rate of spike train data in order to make inferences about the underlying structure of the spike train itself. We first examine a n...
TPHOL
2005
IEEE
14 years 3 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...