6358 search results - page 396 / 1272 » Computing spectral sequences |
169
click to vote
TCS
2008
15 years 6 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
175
Voted
JITECH
2007
15 years 6 months ago
2007
This paper contains a set of personal views relating to NHS Connecting for Health’s National Programme for IT (NPfIT), and in particular its Care Records Service, written from t...
236
Voted
USS
2010
2010
P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users
15 years 4 months ago
In this paper we introduce a framework for privacypreserving distributed computation that is practical for many real-world applications. The framework is called Peers for Privacy ...
176
click to vote
ICIP
2009
IEEE
16 years 7 months ago
2009
IEEE
Alice and Bob possess sequences xn and yn respectively and would like to compute d(xn , yn ) where d(., .) is a distortion measure. However, Alice and Bob do not trust each other ...
188
click to vote
SBBD
2004
15 years 8 months ago
2004
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...