4137 search results - page 309 / 828 » On the number of matchings of a tree |
171
click to vote
FLOPS
2004
Springer
16 years 6 days ago
2004
Springer
We present a graphical tool for the declarative debugging of wrong answers in functional-logic languages. The tool, integrated in the system T OY, can be used to navigate a computa...
148
Voted
ESA
2003
Springer
16 years 23 hour ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
169
click to vote
CPM
2000
Springer
15 years 11 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
181
Voted
IJCAI
2003
15 years 8 months ago
2003
Most recent research of scalable inductive learning on very large dataset, decision tree construction in particular, focuses on eliminating memory constraints and reducing the num...
195
click to vote
RIVF
2003
15 years 8 months ago
2003
— This paper describes the design and implementation of a novel reliable multicast protocol, totally reliable and scalable to large number of receivers. MAF relies on Active Netw...