26 search results - page 5 / 6 » Short Redactable Signatures Using Random Trees |
BMCBI
2008
13 years 5 months ago
2008
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
BIOINFORMATICS
2005
13 years 5 months ago
2005
Motivation: direct bearing whose expres Sorlie et al., 2 gene sets is a diseases (Lossos et al., 2004; Miklos and Maleszka, 2004), and the variables that could account questions i...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
ICCAD
2002
IEEE
14 years 2 months ago
2002
IEEE
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
ECCV
2008
Springer
14 years 3 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...