Sciweavers

91 search results - page 16 / 19
» On value sets of polynomials over a field
Sort
View
131
Voted
ICALP
2011
Springer
14 years 1 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
78
Voted
CHI
2010
ACM
15 years 5 months ago
Spyn: augmenting the creative and communicative potential of craft
We present data collected from a field study of 12 needlecrafters introduced to Spyn—mobile phone software that associates digital records (audio/visual media, text, and geograp...
Daniela Karin Rosner, Kimiko Ryokai
111
Voted
STACS
1999
Springer
15 years 2 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
CVPR
2004
IEEE
16 years 8 days ago
Bayesian Assembly of 3D Axially Symmetric Shapes from Fragments
We present a complete system for the purpose of automatically assembling 3D pots given 3D measurements of their fragments commonly called sherds. A Bayesian approach is formulated...
Andrew R. Willis, David B. Cooper
87
Voted
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
15 years 10 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin