Sciweavers

3818 search results - page 80 / 764
» Word Problems on Compressed Words
Sort
View
FSE
2008
Springer
177views Cryptology» more  FSE 2008»
15 years 6 months ago
MD4 is Not One-Way
MD4 is a hash function introduced by Rivest in 1990. It is still used in some contexts, and the most commonly used hash function (MD5, SHA-1, SHA-2) are based on the design princip...
Gaëtan Leurent
IJAC
2007
59views more  IJAC 2007»
15 years 4 months ago
Polynomial-Time Complexity for Instances of the Endomorphism Problem in Free Groups
Abstract. We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F , there is an endomorphism φ of F ...
Laura Ciobanu
ACL
2010
15 years 2 months ago
WSD as a Distributed Constraint Optimization Problem
This work models Word Sense Disambiguation (WSD) problem as a Distributed Constraint Optimization Problem (DCOP). To model WSD as a DCOP, we view information from various knowledg...
Siva Reddy, Abhilash Inumella
IWOCA
2009
Springer
117views Algorithms» more  IWOCA 2009»
15 years 9 months ago
On the Maximal Number of Cubic Subwords in a String
We investigate the problem of the maximum number of cubic subwords (of the form www) in a given word. We also consider square subwords (of the form ww). The problem of the maximum ...
Marcin Kubica, Jakub Radoszewski, Wojciech Rytter,...
PRICAI
2010
Springer
15 years 2 months ago
Exploiting Symmetry in Relational Similarity for Ranking Relational Search Results
Relational search is a novel paradigm of search which focuses on the similarity between semantic relations. Given three words (A, B, C) as the query, a relational search engine ret...
Tomokazu Goto, Nguyen Tuan Duc, Danushka Bollegala...