Sciweavers

341 search results - page 3 / 69
» Paired bondage in trees
Sort
View
ESA
2009
Springer
120views Algorithms» more  ESA 2009»
14 years 23 days ago
Rank-Pairing Heaps
Abstract. We introduce the rank-pairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pair...
Bernhard Haeupler, Siddhartha Sen, Robert Endre Ta...
ICDM
2007
IEEE
187views Data Mining» more  ICDM 2007»
14 years 15 days ago
Statistical Learning Algorithm for Tree Similarity
Tree edit distance is one of the most frequently used distance measures for comparing trees. When using the tree edit distance, we need to determine the cost of each operation, bu...
Atsuhiro Takasu, Daiji Fukagawa, Tatsuya Akutsu
ICIP
2007
IEEE
14 years 8 months ago
A Multi-Layer MRF Model for Object-Motion Detection in Unregistered Airborne Image-Pairs
In this paper, we give a probabilistic model for automatic change detection on airborne images taken with moving cameras. To ensure robustness, we adopt an unsupervised coarse mat...
Csaba Benedek, Tamas Sziranyi, Zoltan Kato, and Jo...
PAIRING
2010
Springer
155views Cryptology» more  PAIRING 2010»
13 years 4 months ago
Identification of Multiple Invalid Pairing-Based Signatures in Constrained Batches
Abstract. This paper describes a new method in pairing-based signature schemes for identifying the invalid digital signatures in a batch after batch verification has failed. The me...
Brian J. Matt
PKC
2009
Springer
142views Cryptology» more  PKC 2009»
14 years 6 months ago
Identification of Multiple Invalid Signatures in Pairing-Based Batched Signatures
This paper describes new methods in pairing-based signature schemes for identifying the invalid digital signatures in a batch, after batch verification has failed. These methods ef...
Brian J. Matt