Sciweavers

1424 search results - page 285 / 285
» Improving on Version Stamps
Sort
View
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 5 months ago
Explicit capacity-achieving list-decodable codes
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
Venkatesan Guruswami, Atri Rudra
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
14 years 5 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
BMCBI
2007
97views more  BMCBI 2007»
13 years 5 months ago
A verification protocol for the probe sequences of Affymetrix genome arrays reveals high probe accuracy for studies in mouse, hu
Background: The Affymetrix GeneChip technology uses multiple probes per gene to measure its expression level. Individual probe signals can vary widely, which hampers proper interp...
Rudi Alberts, Peter Terpstra, Menno Hardonk, Leoni...
SIAMMA
2011
97views more  SIAMMA 2011»
12 years 8 months ago
Convergence Rates for Greedy Algorithms in Reduced Basis Methods
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald...