5329 search results - page 603 / 1066 » The Weighted Majority Algorithm |
170
click to vote
SODA
1993
ACM
15 years 8 months ago
1993
ACM
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
201
click to vote
BIOCOMP
2009
2009
Improving Remote Homology Detection Using Sequence Properties and Position Specific Scoring Matrices
15 years 8 months ago
Current biological sequence comparison tools frequently fail to recognize matches between homologs when sequence similarity is below the twilight zone of less than 25% sequence id...
167
click to vote
ICMCS
2010
IEEE
15 years 7 months ago
2010
IEEE
Traditional image steganalysis techniques for classification of steganograhic algorithms are conducted with respect to the entire image. In this work, we aim to design a multi-cla...
147
click to vote
AR
2010
15 years 7 months ago
2010
Physical support of lower limbs during sit-to-stand and stand-to-sit transfers is important for an independent life of paraplegic patients. The purpose of this study is, therefore...
183
click to vote
ENDM
2008
15 years 6 months ago
2008
A circular-arc graph is the intersection graph of a set of arcs on the circle. It is a Helly circular-arc graph if it has a Helly model, where every maximal clique is the set of a...