1522 search results - page 71 / 305 » On the Complexity of Several Haplotyping Problems |
OOIS
2001
Springer
14 years 7 days ago
2001
Springer
Identifying the objects that constitute a software system is a critical task for any object-oriented system development and several techniques have already been introduced to tack...
TCS
2008
13 years 7 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
SIGIR
2012
ACM
11 years 10 months ago
2012
ACM
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
COGSCI
2010
13 years 8 months ago
2010
With only two to five slots of visual working memory (VWM), humans are able to quickly solve complex visual problems to near optimal solutions. To explain the paradox between tigh...
CRYPTO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper, we study the existence of multicollisions in iterated hash functions. We show that finding multicollisions, i.e. r-tuples of messages that all hash to the...