Sciweavers

285 search results - page 17 / 57
» New Ways to Construct Binary Search Trees
Sort
View
OPODIS
2001
15 years 1 months ago
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
Lélia Blin, Franck Butelle
GRAPHICSINTERFACE
1997
15 years 1 months ago
Multiresolution BSP Trees Applied to Terrain, Transparency, and General Objects
We present a system for incorporating multiple level of detail (LOD) models of 3D objects within a single hierarchical data structure. This system was designed for a scientific vi...
Charles Wiley, A. T. Campbell III, Stephen A. Szyg...
AUTOMATICA
2004
122views more  AUTOMATICA 2004»
14 years 11 months ago
Approximate explicit receding horizon control of constrained nonlinear systems
An algorithm for the construction of an explicit piecewise linear state feedback approximation to nonlinear constrained receding horizon control is given. It allows such controlle...
Tor Arne Johansen
BMCBI
2010
164views more  BMCBI 2010»
14 years 11 months ago
Pan-genome sequence analysis using Panseq: an online tool for the rapid analysis of core and accessory genomic regions
Background: The pan-genome of a bacterial species consists of a core and an accessory gene pool. The accessory genome is thought to be an important source of genetic variability i...
Chad Laing, Cody Buchanan, Eduardo N. Taboada, Yon...
NN
2000
Springer
192views Neural Networks» more  NN 2000»
14 years 11 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...