Sciweavers

8437 search results - page 595 / 1688
» Preferences over Sets
Sort
View
PKC
2010
Springer
234views Cryptology» more  PKC 2010»
15 years 9 months ago
Solving a 676-Bit Discrete Logarithm Problem in GF(36n)
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shi...
FMICS
2008
Springer
15 years 8 months ago
Efficient Symbolic Model Checking for Process Algebras
Different approaches have been developed to mitigate the state space explosion of model checking techniques. Among them, symbolic verification techniques use efficient representati...
José Vander Meulen, Charles Pecheur
EMNLP
2008
15 years 8 months ago
A Phrase-Based Alignment Model for Natural Language Inference
The alignment problem--establishing links between corresponding phrases in two related sentences--is as important in natural language inference (NLI) as it is in machine translati...
Bill MacCartney, Michel Galley, Christopher D. Man...
KDID
2004
481views Database» more  KDID 2004»
15 years 8 months ago
Models and Indices for Integrating Unstructured Data with a Relational Database
Abstract. Database systems are islands of structure in a sea of unstructured data sources. Several real-world applications now need to create bridges for smooth integration of semi...
Sunita Sarawagi
IJCAI
2003
15 years 8 months ago
Toward Conditional Models of Identity Uncertainty with Application to Proper Noun Coreference
Coreference analysis, also known as record linkage or identity uncertainty, is a difficult and important problem in natural language processing, databases, citation matching and ...
Andrew McCallum, Ben Wellner