Sciweavers

2899 search results - page 244 / 580
» Dynamic Trees in Practice
Sort
View
AGTIVE
2003
Springer
15 years 10 months ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman
135
Voted
BMCBI
2006
92views more  BMCBI 2006»
15 years 5 months ago
Recrafting the neighbor-joining method
Background: The neighbor-joining method by Saitou and Nei is a widely used method for constructing phylogenetic trees. The formulation of the method gives rise to a canonical (n3)...
Thomas Mailund, Gerth Stølting Brodal, Rolf...
IJCNN
2007
IEEE
15 years 11 months ago
The Improved Correlation Matrix Memory (CMML)
—This paper examines the motivation and concepts of dynamic encoders (for binary neural networks) introduced by Shah in the author’s RASC 2004 and 2006 conference papers [1], [...
Nimish Shah, Simon O'Keefe, Jim Austin
CSFW
2006
IEEE
15 years 11 months ago
Secrecy by Typing and File-Access Control
Secrecy properties can be guaranteed through a combination of static and dynamic checks. The static checks may include the application of special type systems with notions of secr...
Avik Chaudhuri, Martín Abadi
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 10 months ago
Search space modulation in genetic algorithms: evolving the search space by sinusoidal transformations
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into...
José Antonio Martin H.