Sciweavers

4926 search results - page 480 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
JCC
2007
131views more  JCC 2007»
15 years 3 months ago
An extended dead-end elimination algorithm to determine gap-free lists of low energy states
: Proteins are flexible systems and commonly populate several functionally important states. To understand protein function, these states and their energies have to be identified...
Edda Kloppmann, G. Matthias Ullmann, Torsten Becke...
BMVC
2010
15 years 1 months ago
StyP-Boost: A Bilinear Boosting Algorithm for Learning Style-Parameterized Classifiers
We introduce a novel bilinear boosting algorithm, which extends the multi-class boosting framework of JointBoost to optimize a bilinear objective function. This allows style param...
Jonathan Warrell, Philip H. S. Torr, Simon Prince
EMMCVPR
1999
Springer
15 years 8 months ago
Bayesian Models for Finding and Grouping Junctions
In this paper, we propose two Bayesian methods for detecting and grouping junctions. Our junction detection method evolves from the Kona approach, and it is based on a competitive ...
Miguel Cazorla, Francisco Escolano, Domingo Gallar...
DAC
1994
ACM
15 years 8 months ago
RC Interconnect Optimization Under the Elmore Delay Model
An e cient solution to the wire sizing problem WSP usingthe Elmoredelaymodelisproposed. Two formulations of the problem are put forth: in the rst, the minimum interconnect delay i...
Sachin S. Sapatnekar
JMLR
2010
129views more  JMLR 2010»
14 years 10 months ago
Approximation of hidden Markov models by mixtures of experts with application to particle filtering
Selecting conveniently the proposal kernel and the adjustment multiplier weights of the auxiliary particle filter may increase significantly the accuracy and computational efficie...
Jimmy Olsson, Jonas Ströjby