4212 search results - page 545 / 843 » On Compressible Pairings and Their Computation |
189
Voted
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
Unconstrained face recognition is the problem of deciding if an image pair is showing the same individual or not, without having class specific training material or knowing anythi...
183
click to vote
ICTAI
2009
IEEE
15 years 4 months ago
2009
IEEE
We address the problem of merging qualitative constraints networks (QCNs). We point out a merging algorithm which computes a consistent QCN representing a global view of the input...
160
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Matching dependencies (MDs) are used to declaratively specify the identification (or matching) of certain attribute values in pairs of database tuples when some similarity conditi...
173
click to vote
DM
2010
15 years 4 months ago
2010
A dodecagon quadrangle is the graph consisting of two cycles: a 12-cycle (x1, x2, ..., x12) and a 4-cycle (x1, x4, x7, x10). A dodecagon quadrangle system of order n and index [D...
188
click to vote
INFORMATICALT
2010
15 years 4 months ago
2010
A proxy signature scheme enables an original signer to delegate its signing capability to a proxy signer and then the proxy signer can sign a message on behalf of the original sign...