Sciweavers

1143 search results - page 37 / 229
» pairing 2007
Sort
View
ENTCS
2007
109views more  ENTCS 2007»
13 years 10 months ago
Improving the Context-sensitive Dependency Graph
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
Beatriz Alarcón, Raúl Gutiérr...
ACL
2006
13 years 11 months ago
Named Entity Transliteration with Comparable Corpora
In this paper we investigate ChineseEnglish name transliteration using comparable corpora, corpora where texts in the two languages deal in some of the same topics -- and therefor...
Richard Sproat, Tao Tao, ChengXiang Zhai
JDA
2007
77views more  JDA 2007»
13 years 9 months ago
Path coupling without contraction
Path coupling is a useful technique for simplifying the analysis of a coupling of a Markov chain. Rather than defining and analysing the coupling on every pair in Ω×Ω, where...
Magnus Bordewich, Martin E. Dyer
ECSQARU
2007
Springer
14 years 1 months ago
Conflict Analysis and Merging Operators Selection in Possibility Theory
In possibility theory, the degree of inconsistency is commonly used to measure the level of conflict in information from multiple sources after merging, especially conjunctive merg...
Weiru Liu
PAIRING
2007
Springer
134views Cryptology» more  PAIRING 2007»
14 years 4 months ago
Proxy Re-encryption Systems for Identity-Based Encryption
A proxy re-encryption system allows the proxy to transform ciphertexts encrypted under Alice’s public key into the different ciphertexts that can be decrypted by Bob’s secret ...
Toshihiko Matsuo