Sciweavers

341 search results - page 13 / 69
» Paired bondage in trees
Sort
View
DEXA
2005
Springer
138views Database» more  DEXA 2005»
15 years 3 months ago
Full-Text and Structural XML Indexing on B+-Tree
XML query processing is one of the most active areas of database research. Although the main focus of past research has been the processing of structural XML queries, there are gro...
Toshiyuki Shimizu, Masatoshi Yoshikawa
FSTTCS
2001
Springer
15 years 2 months ago
Rewrite Closure for Ground and Cancellative AC Theories
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
Ashish Tiwari
ILP
2003
Springer
15 years 2 months ago
Graph Kernels and Gaussian Processes for Relational Reinforcement Learning
RRL is a relational reinforcement learning system based on Q-learning in relational state-action spaces. It aims to enable agents to learn how to act in an environment that has no ...
Thomas Gärtner, Kurt Driessens, Jan Ramon
63
Voted
VLDB
2005
ACM
226views Database» more  VLDB 2005»
15 years 3 months ago
BATON: A Balanced Tree Structure for Peer-to-Peer Networks
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure caus...
H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu
101
Voted
ICIP
2001
IEEE
15 years 11 months ago
Feature coincidence trees for registration of ultrasound breast images
Registration of an image, the query or reference, to a database of rotated and translated exemplars constitutes an important image retrieval and indexing application which arises i...
Huzefa Neemuchwala, Alfred O. Hero, Paul L. Carson