Sciweavers

664 search results - page 94 / 133
» Some results for a class of generalized polynomials
Sort
View
INFOCOM
2008
IEEE
15 years 4 months ago
How Many Packets Can We Encode? - An Analysis of Practical Wireless Network Coding
— While the practical coding scheme [1] has been shown to be able to improve throughput of wireless networks, there still lacks fundamental understanding on how the coding scheme...
Jilin Le, John C. S. Lui, Dah-Ming Chiu
EUROCRYPT
2008
Springer
14 years 11 months ago
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
Nishanth Chandran, Vipul Goyal, Amit Sahai
CVPR
2010
IEEE
15 years 2 months ago
The Automatic Design of Feature Spaces for Local Image Descriptors using an Ensemble of Non-linear Feature Extractors
The design of feature spaces for local image descriptors is an important research subject in computer vision due to its applicability in several problems, such as visual classifi...
Gustavo Carneiro
ML
1998
ACM
14 years 9 months ago
On Restricted-Focus-of-Attention Learnability of Boolean Functions
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jac...
TPHOL
2007
IEEE
15 years 4 months ago
Verifying Nonlinear Real Formulas Via Sums of Squares
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
John Harrison