1522 search results - page 119 / 305 » On the Complexity of Several Haplotyping Problems |
ASIACRYPT
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
ICML
2009
IEEE
14 years 10 months ago
2009
IEEE
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
RECOMB
2003
Springer
14 years 9 months ago
2003
Springer
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...
KDD
2009
ACM
14 years 3 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
CCGRID
2009
IEEE
14 years 3 months ago
2009
IEEE
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...