Sciweavers

2107 search results - page 85 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
HYBRID
2004
Springer
15 years 8 months ago
Approximations of the Rate of Growth of Switched Linear Systems
The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This...
Vincent D. Blondel, Yurii Nesterov, Jacques Theys
142
Voted
BMCBI
2007
143views more  BMCBI 2007»
15 years 3 months ago
An adaptive bin framework search method for a beta-sheet protein homopolymer model
Background: The problem of protein structure prediction consists of predicting the functional or native structure of a protein given its linear sequence of amino acids. This probl...
Alena Shmygelska, Holger H. Hoos
CVPR
2004
IEEE
16 years 5 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
IPPS
1997
IEEE
15 years 7 months ago
On the Dynamic Initialization of Parallel Computers
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
126
Voted
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
15 years 9 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...