1731 search results - page 269 / 347 » Maximum likelihood analysis of algorithms and data structure... |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
BIODATAMINING
2008
13 years 8 months ago
2008
This editorial introduces BioData Mining, a new journal which publishes research articles related to advances in computational methods and techniques for the extraction of useful ...
CIKM
2011
Springer
12 years 7 months ago
2011
Springer
Powerful SIMD instructions in modern processors offer an opportunity for greater search performance. In this paper, we apply these instructions to decoding search engine posting ...
ACAL
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. This paper illustrates how the Quadratic Assignment Problem (QAP) is used as a mathematical model that helps to produce a visualization of microarray data, based on the r...
TAMC
2009
Springer
14 years 2 months ago
2009
Springer
Computability concerns information with a causal – typically algorithmic – structure. As such, it provides a schematic analysis of many naturally occurring situations. We look ...