4095 search results - page 269 / 819 » How to test a tree |
107
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
61
Voted
CG
2004
Springer
15 years 6 months ago
2004
Springer
Kriegspiel is a Chess variant similar to wargames, in which players have to deal with uncertainty. Kriegspiel increases the difficulty typical of Chess by hiding from each player h...
122
Voted
SSDBM
2003
IEEE
15 years 6 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
116
click to vote
AOSD
2003
ACM
15 years 6 months ago
2003
ACM
We define a generic join point model for checking the Law of Demeter (LoD). Join points are trees, pointcuts are predicates over join points, and advice is checked statically sim...
85
Voted
DCC
1996
IEEE
15 years 4 months ago
1996
IEEE
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...