21324 search results - page 521 / 4265 » Making the case for computing |
218
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
192
click to vote
CVPR
2000
IEEE
16 years 9 months ago
2000
IEEE
The Errors-in-Variables (EIV) model from statistics is often employed in computer vision thoughonlyrarely under this name. In an EIV model all the measurements are corrupted by no...
195
click to vote
WINE
2005
Springer
16 years 18 days ago
2005
Springer
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
205
click to vote
STOC
1996
ACM
15 years 11 months ago
1996
ACM
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
193
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: Protein-protein interactions are fundamental for the majority of cellular processes and their study is of enormous biotechnological and therapeutic interest. In recent...