Sciweavers

1243 search results - page 96 / 249
» Generating Trees on Multisets
Sort
View
CTRSA
2009
Springer
128views Cryptology» more  CTRSA 2009»
15 years 4 months ago
Short Redactable Signatures Using Random Trees
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
Ee-Chien Chang, Chee Liang Lim, Jia Xu
SAC
2003
ACM
15 years 3 months ago
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Günther R. Raidl, Bryant A. Julstrom
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 1 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
BMCBI
2010
109views more  BMCBI 2010»
14 years 10 months ago
Predicting gene function using hierarchical multi-label decision tree ensembles
Background: S. cerevisiae, A. thaliana and M. musculus are well-studied organisms in biology and the sequencing of their genomes was completed many years ago. It is still a challe...
Leander Schietgat, Celine Vens, Jan Struyf, Hendri...
DAC
1999
ACM
15 years 11 months ago
Constraint Driven Code Selection for Fixed-Point DSPs
Abstract? Fixed-point DSPs are a class of embedded processors with highly irregular architectures. This irregularity makes it difficult to generate high-quality machine code from p...
Steven Bashford, Rainer Leupers