688 search results - page 53 / 138 » Types for trees |
83
Voted
ICFP
2008
ACM
16 years 22 days ago
2008
ACM
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
99
Voted
SMI
2005
IEEE
15 years 6 months ago
2005
IEEE
For time-dependent scalar fields, one is often interested in topology changes of contours in time. In this paper, we focus on describing how contours split and merge over a certa...
101
click to vote
SIGECOM
2004
ACM
15 years 6 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
109
click to vote
ICALP
1990
Springer
15 years 4 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
IACR
2011
14 years 13 days ago
2011
— Both broadcast encryption (BE) protocols and multicast key distribution (MKD) protocols try to solve the same problem of private group communication. For the first time, we dis...