Sciweavers

307 search results - page 7 / 62
» The Reference Return Ratio
Sort
View
WAOA
2007
Springer
126views Algorithms» more  WAOA 2007»
14 years 1 months ago
Better Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
Marek Chrobak, Mathilde Hurand
ICPP
1998
IEEE
13 years 12 months ago
Improving Parallel-Disk Buffer Management using Randomized Writeback
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
Mahesh Kallahalla, Peter J. Varman
IPL
2006
114views more  IPL 2006»
13 years 7 months ago
Quantum lower bounds for the Goldreich-Levin problem
At the heart of the Goldreich-Levin Theorem is the problem of determining an n-bit string a by making queries to two oracles, referred to as IP (inner product) and EQ (equivalence...
Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H...
BMCBI
2004
128views more  BMCBI 2004»
13 years 7 months ago
Comparing transformation methods for DNA microarray data
Background: When DNA microarray data are used for gene clustering, genotype/phenotype correlation studies, or tissue classification the signal intensities are usually transformed ...
Helene H. Thygesen, Aeilko H. Zwinderman
COLING
2002
13 years 7 months ago
A Stochastic Parser Based on an SLM with Arboreal Context Trees
In this paper, we present a parser based on a stochastic structured language model (SLM) with a exible history reference mechanism. An SLM is an alternative to an n-gram model as...
Shinsuke Mori