Sciweavers

583 search results - page 104 / 117
» On small blocking sets and their linearity
Sort
View
CORR
2011
Springer
142views Education» more  CORR 2011»
13 years 10 days ago
On the Locality of Codeword Symbols
Consider a linear [n, k, d]q code C. We say that that i-th coordinate of C has locality r, if the value at this coordinate can be recovered from accessing some other r coordinates...
Parikshit Gopalan, Cheng Huang, Huseyin Simitci, S...
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
12 years 8 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
VLSID
2009
IEEE
108views VLSI» more  VLSID 2009»
14 years 9 months ago
Metric Based Multi-Timescale Control for Reducing Power in Embedded Systems
Abstract--Digital control for embedded systems often requires low-power, hard real-time computation to satisfy high control-loop bandwidth, low latency, and low-power requirements....
Forrest Brewer, João Pedro Hespanha, Nitin ...
RECOMB
2005
Springer
14 years 9 months ago
Causal Inference of Regulator-Target Pairs by Gene Mapping of Expression Phenotypes
Background: Correlations between polymorphic markers and observed phenotypes provide the basis for mapping traits in quantitative genetics. When the phenotype is gene expression, ...
David Kulp, Manjunatha Jagalur
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 8 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng