Sciweavers

281 search results - page 17 / 57
» Primitive words and roots of words
Sort
View
FSE
2005
Springer
106views Cryptology» more  FSE 2005»
14 years 1 months ago
New Applications of T-Functions in Block Ciphers and Hash Functions
A T-function is a mapping from n-bit words to n-bit words in which for each 0 ≤ i < n, bit i of any output word can depend only on bits 0, 1, . . . , i of any input word. All ...
Alexander Klimov, Adi Shamir
CICLING
2008
Springer
13 years 9 months ago
Deep Lexical Semantics
In the project we describe, we have taken a basic core of about 5000 synsets in WordNet that are the most frequently used, and we have categorized these into sixteen broad categori...
Jerry R. Hobbs
NA
2010
118views more  NA 2010»
13 years 6 months ago
Practical Quasi-Newton algorithms for singular nonlinear systems
Quasi-Newton methods for solving singular systems of nonlinear equations are considered in this paper. Singular roots cause a number of problems in implementation of iterative met...
Sandra Buhmiler, Natasa Krejic, Zorana Luzanin
COSIT
2009
Springer
119views GIS» more  COSIT 2009»
14 years 2 months ago
Grounding Geographic Categories in the Meaningful Environment
Abstract. Ontologies are a common approach to improve semantic interoperability by explicitly specifying the vocabulary used by a particular information community. Complex expressi...
Simon Scheider, Krzysztof Janowicz, Werner Kuhn
IJAC
2007
116views more  IJAC 2007»
13 years 7 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil