Sciweavers

2111 search results - page 66 / 423
» Understanding the Yarowsky Algorithm
Sort
View
JCC
2007
131views more  JCC 2007»
14 years 9 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...
KDD
2005
ACM
142views Data Mining» more  KDD 2005»
15 years 10 months ago
Towards exploratory test instance specific algorithms for high dimensional classification
In an interactive classification application, a user may find it more valuable to develop a diagnostic decision support method which can reveal significant classification behavior...
Charu C. Aggarwal
WWIC
2009
Springer
157views Communications» more  WWIC 2009»
15 years 4 months ago
An Adaptive Optimized RTO Algorithm for Multi-homed Wireless Environments
As a transport layer protocol SCTP uses end to end metrics, such as Retransmission Time Out (RTO), to manage mobility handover. Our investigation illustrates that Wireless LAN (WLA...
Sheila Fallon, Paul Jacob, Yuansong Qiao, Liam Mur...
ICANN
2009
Springer
15 years 4 months ago
Algorithms for Structural and Dynamical Polychronous Groups Detection
Polychronization has been proposed as a possible way to investigate the notion of cell assemblies and to understand their role as memory supports for information coding. In a spiki...
Régis Martinez, Hélène Paugam...
SAT
2009
Springer
113views Hardware» more  SAT 2009»
15 years 4 months ago
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...
Albert Atserias, Johannes Klaus Fichte, Marc Thurl...