807 search results - page 29 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
238
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
138
click to vote
NOSSDAV
2005
Springer
15 years 9 months ago
2005
Springer
We are concerned with the fundamental problem of event ordering in multiplayer peer-to-peer games. Event ordering, even without faults, requires all-to-all message passing with at...
139
click to vote
NJC
2000
15 years 3 months ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
233
click to vote
ICDE
2004
IEEE
16 years 5 months ago
2004
IEEE
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousan...
131
click to vote
AIPS
2008
15 years 6 months ago
2008
During the past few years, point-based POMDP solvers have gradually scaled up to handle medium sized domains through better selection of the set of points and efficient backup met...