47 search results - page 7 / 10 » And Or Trees Revisited |
DGCI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper presents new results about digital straight segments, their recognition and related properties. They come from the study of the arithmetically based recognitio...
SODA
1998
ACM
13 years 8 months ago
1998
ACM
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
Most debuggers are notoriously machine-dependent, but some recent research prototypes achieve varying degrees of machine-independence with novel designs. Cdb, a simple source-leve...
ICTAI
2003
IEEE
14 years 20 days ago
2003
IEEE
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
ACNS
2007
Springer
14 years 1 months ago
2007
Springer
The one-way function tree (OFT) scheme proposed by Balenson et. al is widely regarded as an efficient key management solution for multicast communication in large dynamic groups. ...