534 search results - page 67 / 107 » Efficient polynomial L-approximations |
109
click to vote
ISBI
2008
IEEE
16 years 2 months ago
2008
IEEE
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...
116
click to vote
STOC
1994
ACM
15 years 6 months ago
1994
ACM
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...
147
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
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...
144
click to vote
EUROCRYPT
2000
Springer
15 years 5 months ago
2000
Springer
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...
125
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
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...