Sciweavers

1871 search results - page 18 / 375
» The Ephemeral Pairing Problem
Sort
View
CIVR
2008
Springer
279views Image Analysis» more  CIVR 2008»
13 years 9 months ago
Semi-supervised learning of object categories from paired local features
This paper presents a semi-supervised learning (SSL) approach to find similarities of images using statistics of local matches. SSL algorithms are well known for leveraging a larg...
Wen Wu, Jie Yang
AAAI
2012
11 years 9 months ago
The Price of Neutrality for the Ranked Pairs Method
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...
Markus Brill, Felix A. Fischer
TIT
2002
94views more  TIT 2002»
13 years 7 months ago
A generalized uncertainty principle and sparse representation in pairs of bases
An elementary proof of a basic uncertainty principle concerning pairs of representations of vectors in different orthonormal bases is provided. The result, slightly stronger than s...
Michael Elad, Alfred M. Bruckstein
WABI
2004
Springer
14 years 23 days ago
Finding Optimal Pairs of Patterns
We consider the problem of finding the optimal pair of string patterns for discriminating between two sets of strings, i.e. finding the pair of patterns that is best with respect...
Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, ...
AINA
2005
IEEE
14 years 1 months ago
Secure One-Round Tripartite Authenticated Key Agreement Protocol from Weil Pairing
In 2000, Joux proposed a one-round protocol for tripartite Diffie-Hellman. In 2003, Shim presented an efficient one-round tripartite authenticated key agreement protocol based on ...
Chu-Hsing Lin, Hsiu-Hsia Lin