Sciweavers

46 search results - page 4 / 10
» Descartes' Rule of Signs
Sort
View
UAIS
2008
104views more  UAIS 2008»
13 years 9 months ago
A knowledge-based sign synthesis architecture
This paper presents the modules that comprise a knowledge-based sign synthesis architecture for Greek sign language (GSL). Such systems combine natural language (NL) knowledge, mac...
Stavroula-Evita Fotinea, Eleni Efthimiou, George C...
IAJIT
2010
99views more  IAJIT 2010»
13 years 8 months ago
Semiotics Explorations on Designing the Information Intensive Web Interfaces
: The growth of technological innovations, internet developments, and their (web) applications has raised a definite issue on retaining the web interface quite understandable. More...
Muhammad Islam, Mohsin Ali, Ali Al-Mamun, Motaharu...
IJCAI
2007
13 years 11 months ago
The Logic Behind Weighted CSP
We define a translation from Weighted CSP to signed Max-SAT, and a complete resolution-style calculus for solving signed Max-SAT. Based on these results, we then describe an orig...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
CRYPTO
2011
Springer
232views Cryptology» more  CRYPTO 2011»
12 years 9 months ago
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elem...
Masayuki Abe, Jens Groth, Kristiyan Haralambiev, M...
EUROCRYPT
1999
Springer
14 years 1 months ago
An Analysis of Exponentiation Based on Formal Languages
A recoding rule for exponentiation is a method for reducing the cost of the exponentiation ae by reducing the number of required multiplications. If w(e) is the (hamming) weight of...
Luke O'Connor