2899 search results - page 134 / 580 » Dynamic Trees in Practice |
177
click to vote
STOC
1994
ACM
15 years 7 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
102
click to vote
EUROPKI
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. A substantial number of micropayment schemes in the literature are based on distributing the cost of a digital signature over several successive micropayments (e.g. Paywo...
160
Voted
DATAMINE
1999
15 years 2 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
111
click to vote
ICPR
2000
IEEE
16 years 4 months ago
2000
IEEE
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
118
click to vote
ICC
2009
IEEE
15 years 9 months ago
2009
IEEE
— Supporting user interactivity in peer-to-peer streaming systems is challenging. VCR-like operations, such as random seek, pause, fast forward and rewind, require timely P2P ove...