Sciweavers

1594 search results - page 187 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
109
Voted
EUROCRYPT
2004
Springer
15 years 9 months ago
Merkle Tree Traversal in Log Space and Time
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
Michael Szydlo
133
Voted
COMGEO
2008
ACM
15 years 3 months ago
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...
Robert L. Scot Drysdale, Günter Rote, Astrid ...
DAC
2004
ACM
16 years 4 months ago
Fast statistical timing analysis handling arbitrary delay correlations
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
Michael Orshansky, Arnab Bandyopadhyay
238
Voted
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
16 years 4 months ago
Closest-Point-of-Approach Join for Moving Object Histories
In applications that produce a large amount of data describing the paths of moving objects, there is a need to ask questions about the interaction of objects over a long recorded ...
Subramanian Arumugam, Chris Jermaine
MOBIHOC
2002
ACM
16 years 3 months ago
Routing performance in the presence of unidirectional links in multihop wireless networks
We examine two aspects concerning the influence of unidirectional links on routing performance in multihop wireless networks. In the first part of the paper, we evaluate the benef...
Mahesh K. Marina, Samir Ranjan Das