Sciweavers

4095 search results - page 429 / 819
» How to test a tree
Sort
View
170
Voted
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
15 years 5 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
IPPS
2010
IEEE
15 years 4 months ago
A scalable algorithm for maintaining perpetual system connectivity in dynamic distributed systems
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
Tarun Bansal, Neeraj Mittal
231
Voted
PAIRING
2010
Springer
155views Cryptology» more  PAIRING 2010»
15 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
194
Voted
BMCBI
2011
15 years 1 months ago
iPhy: an integrated phylogenetic workbench for supermatrix analyses
Background: The increasing availability of molecular sequence data means that the accuracy of future phylogenetic studies is likely to by limited by systematic bias and taxon choi...
Martin O. Jones, Georgios D. Koutsovoulos, Mark L....
205
Voted
ICDE
2012
IEEE
202views Database» more  ICDE 2012»
13 years 8 months ago
Differentially Private Spatial Decompositions
— Differential privacy has recently emerged as the de facto standard for private data release. This makes it possible to provide strong theoretical guarantees on the privacy and ...
Graham Cormode, Cecilia M. Procopiuc, Divesh Sriva...