Sciweavers

143 search results - page 25 / 29
» How to rank with few errors
Sort
View
BMCBI
2007
194views more  BMCBI 2007»
13 years 5 months ago
A meta-data based method for DNA microarray imputation
Background: DNA microarray experiments are conducted in logical sets, such as time course profiling after a treatment is applied to the samples, or comparisons of the samples unde...
Rebecka Jörnsten, Ming Ouyang, Hui-Yu Wang
BMCBI
2006
84views more  BMCBI 2006»
13 years 5 months ago
Inferring topology from clustering coefficients in protein-protein interaction networks
Background: Although protein-protein interaction networks determined with high-throughput methods are incomplete, they are commonly used to infer the topology of the complete inte...
Caroline C. Friedel, Ralf Zimmer
KDD
2007
ACM
154views Data Mining» more  KDD 2007»
14 years 6 months ago
Canonicalization of database records using adaptive similarity measures
It is becoming increasingly common to construct databases from information automatically culled from many heterogeneous sources. For example, a research publication database can b...
Aron Culotta, Michael L. Wick, Robert Hall, Matthe...
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
13 years 11 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 5 months ago
Particle Filtering for Large Dimensional State Spaces with Multimodal Observation Likelihoods
We study efficient importance sampling techniques for particle filtering (PF) when either (a) the observation likelihood (OL) is frequently multimodal or heavy-tailed, or (b) the s...
Namrata Vaswani