Sciweavers

534 search results - page 67 / 107
» Efficient polynomial L-approximations
Sort
View
ISBI
2008
IEEE
14 years 8 months ago
Robust image registration based on a Partition of Unity Finite Element Method
In this paper, we present a robust, hierarchical Partition of Unity Finite Element Method (PUFEM) to compute the transformation between two images, which is represented by a non-r...
Laurent D. Cohen, Oudom Somphone, Shérif Ma...
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
13 years 12 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 8 months ago
Index coding via linear programming
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
EUROCRYPT
2000
Springer
13 years 11 months ago
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
Ronald Cramer, Ivan Damgård, Ueli M. Maurer
IPPS
2003
IEEE
14 years 1 months ago
Importance of SIMD Computation Reconsidered
In this paper, SIMD and MIMD solutions for the realtime database management problem of air traffic control are compared. A real-time database system is highly constrained in a mul...
Will C. Meilander, Johnnie W. Baker, Mingxian Jin