Sciweavers

315 search results - page 14 / 63
» Algebraic Lower Bounds for Computing on Encrypted Data
Sort
View
98
Voted
JMLR
2012
12 years 12 months ago
Minimax rates for homology inference
Often, high dimensional data lie close to a low-dimensional submanifold and it is of interest to understand the geometry of these submanifolds. The homology groups of a manifold a...
Sivaraman Balakrishnan, Alessandro Rinaldo, Don Sh...
JCP
2008
119views more  JCP 2008»
14 years 9 months ago
Performance Comparisons, Design, and Implementation of RC5 Symmetric Encryption Core using Reconfigurable Hardware
With the wireless communications coming to homes and offices, the need to have secure data transmission is of utmost importance. Today, it is important that information is sent con...
Omar S. Elkeelany, Adegoke Olabisi
ICCV
2001
IEEE
15 years 11 months ago
Multiple View Geometry of Non-planar Algebraic Curves
We introduce a number of new results in the context of multi-view geometry from general algebraic curves. We start with the derivation of the extended Kruppa's equations whic...
Jeremy Yermiyahou Kaminski, Michael Fryers, Amnon ...
FOCS
1992
IEEE
15 years 1 months ago
Reconstructing Algebraic Functions from Mixed Data
We consider a variant of the traditional task of explicitly reconstructing algebraic functions from black box representations. In the traditional setting for such problems, one is ...
Sigal Ar, Richard J. Lipton, Ronitt Rubinfeld, Mad...
CORR
2006
Springer
138views Education» more  CORR 2006»
14 years 9 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite