Sciweavers

685 search results - page 24 / 137
» Succinct Trees in Practice
Sort
View
SRDS
2008
IEEE
14 years 1 months ago
Self-Stabilization in Tree-Structured Peer-to-Peer Service Discovery Systems
The efficiency of service discovery is critical in the development of fully decentralized middleware intended to manage large scale computational grids. This demand influenced t...
Eddy Caron, Ajoy Kumar Datta, Franck Petit, C&eacu...
ICTAI
2003
IEEE
14 years 25 days ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
FC
2008
Springer
90views Cryptology» more  FC 2008»
13 years 9 months ago
Practical Anonymous Divisible E-Cash from Bounded Accumulators
We present an efficient off-line divisible e-cash scheme which is truly anonymous without a trusted third party. This is the second scheme in the literature which achieves full unl...
Man Ho Au, Willy Susilo, Yi Mu
CASCON
1992
163views Education» more  CASCON 1992»
13 years 8 months ago
Practical metaprogramming
Metaprogramming is the process of specifying generic software source templates from which classes of software components, or parts thereof, can be automatically instantiated to pr...
James R. Cordy, Medha Shukla
ICDE
2007
IEEE
190views Database» more  ICDE 2007»
13 years 11 months ago
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong