1029 search results - page 118 / 206 » Probabilistic Recurrence Relations |
138
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
109
click to vote
WPES
2003
ACM
15 years 8 months ago
2003
ACM
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
133
click to vote
TAMODIA
2007
15 years 4 months ago
2007
Abstract. Covering quality aspects such as usability through the software development life cycle is challenging. These “-ilities” are generally difficult to grasp and usually ...
128
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: The Salivaomics Knowledge Base (SKB) is designed to serve as a computational infrastructure that can permit global exploration and utilization of data and information ...
137
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: Prediction of protein structural classes (a, b, a + b and a/b) from amino acid sequences is of great importance, as it is beneficial to study protein function, regulat...