Sciweavers

1790 search results - page 3 / 358
» Noise in Bilinear Problems
Sort
View
CVPR
1997
IEEE
13 years 12 months ago
Learning bilinear models for two-factor problems in vision
In many vision problems, we want to infer two (or more) hidden factors which interact to produce our observations. We may want to disentangle illuminant and object colors in color...
William T. Freeman, Joshua B. Tenenbaum
AUTOMATICA
2006
91views more  AUTOMATICA 2006»
13 years 7 months ago
Necessary and sufficient conditions for reachability on a simplex
In this paper we solve the general problem of designing a feedback controller to reach a set of facets of an n-dimensional simplex in finite time, for a system evolving with linea...
Bartek Roszak, Mireille E. Broucke
CISC
2007
Springer
117views Cryptology» more  CISC 2007»
13 years 11 months ago
An Efficient ID-Based Proxy Signature Scheme from Pairings
This paper proposes a new ID-based proxy signature scheme based on the bilinear pairings. The number of paring operation involved in the verification procedure of our scheme is onl...
Chunxiang Gu, Yuefei Zhu
FOCS
2007
IEEE
13 years 11 months ago
Space-Efficient Identity Based Encryption Without Pairings
Identity Based Encryption (IBE) systems are often constructed using bilinear maps (a.k.a. pairings) on elliptic curves. One exception is an elegant system due to Cocks which build...
Dan Boneh, Craig Gentry, Michael Hamburg