16430 search results - page 330 / 3286 » On Computable Tree Functions |
130
click to vote
SPIRE
2009
Springer
15 years 11 months ago
2009
Springer
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ï...
149
Voted
BTW
2005
Springer
15 years 10 months ago
2005
Springer
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
252
click to vote
ICAART
2010
INSTICC
16 years 2 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
131
Voted
CIE
2007
Springer
15 years 11 months ago
2007
Springer
Concerning the set of rooted binary trees, one shows that Higmanâs Lemma and Dershowitzâs recursive path ordering can be used for the decision of its maximal order type accordi...
140
click to vote
MFCS
2007
Springer
15 years 11 months ago
2007
Springer
We investigate algorithmic properties of inïŹnite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...