Sciweavers

2654 search results - page 469 / 531
» On Pairing Inversion Problems
Sort
View
SODA
1997
ACM
115views Algorithms» more  SODA 1997»
15 years 2 months ago
On-Line Difference Maximization
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
Ming-Yang Kao, Stephen R. Tate
101
Voted
BMCBI
2010
86views more  BMCBI 2010»
15 years 27 days ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King
109
Voted
BMCBI
2007
142views more  BMCBI 2007»
15 years 27 days ago
Improving model construction of profile HMMs for remote homology detection through structural alignment
Background: Remote homology detection is a challenging problem in Bioinformatics. Arguably, profile Hidden Markov Models (pHMMs) are one of the most successful approaches in addre...
Juliana S. Bernardes, Alberto M. R. Dávila,...
88
Voted
CORR
2006
Springer
120views Education» more  CORR 2006»
15 years 25 days ago
On the Role of Shared Entanglement
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
Dmitry Gavinsky
85
Voted
IJSN
2006
65views more  IJSN 2006»
15 years 23 days ago
The loop fallacy and deterministic serialisation in tracing intrusion connections through stepping stones
: In order to conceal their identity and origin, network based intruders seldom attack directly from their own hosts, but rather stage their attacks through intermediate `stepping ...
Xinyuan Wang