Sciweavers

1871 search results - page 19 / 375
» The Ephemeral Pairing Problem
Sort
View
ACL
2008
13 years 8 months ago
Phrase Table Training for Precision and Recall: What Makes a Good Phrase and a Good Phrase Pair?
In this work, the problem of extracting phrase translation is formulated as an information retrieval process implemented with a log-linear model aiming for a balanced precision an...
Yonggang Deng, Jia Xu, Yuqing Gao
IPL
2002
65views more  IPL 2002»
13 years 7 months ago
A new bound for map labeling with uniform circle pairs
Given a planar point set, we wish to label the points with uniform circular labels such that each input point lies on the boundary of two labels, none of the interiors of the labe...
Michael J. Spriggs, J. Mark Keil
IJNSEC
2010
91views more  IJNSEC 2010»
13 years 2 months ago
An Improvement on a Three-party Password-based Key Exchange Protocol Using Weil Pairing
The three-party password-based key exchange protocols using Weil pairing proposed by Wen is vulnerable to impersonation attack. By introducing hard artificial intelligence problem...
Yong Zeng, Jianfeng Ma, Sang-Jae Moon
ICIP
2009
IEEE
14 years 8 months ago
Bayesian Blind Deconvolution From Differently Exposed Image Pairs
Photographs acquired under low-light conditions require long exposure times and therefore exhibit significant blurring due to the shaking of the camera. Using shorter exposure tim...
IJNSEC
2008
154views more  IJNSEC 2008»
13 years 7 months ago
ID-based Weak Blind Signature From Bilinear Pairings
In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can�...
Ze-mao Zhao