Sciweavers

13603 search results - page 352 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
ICISC
2007
96views Cryptology» more  ICISC 2007»
15 years 9 months ago
Colliding Message Pair for 53-Step HAS-160
We present a collision attack on the hash function HAS-160 reduced to 53-steps. The attack has a complexity of about 235 hash computations. The attack is based on the work of Cho e...
Florian Mendel, Vincent Rijmen
STAIRS
2008
175views Education» more  STAIRS 2008»
15 years 9 months ago
Learning Process Behavior with EDY: an Experimental Analysis
This paper presents an extensive evaluation, on artificial datasets, of EDY, an unsupervised algorithm for automatically synthesizing a Structured Hidden Markov Model (S-HMM) from ...
Ugo Galassi
APVIS
2006
15 years 9 months ago
Interactive optimization in cooperative environments
In the present paper, we introduce a multi-user interactive framework for solving complex optimization problems. The framework, called Co-UserHints, provides a visual computationa...
Joelma de Moura Ferreira, Hugo A. D. do Nascimento...
ACL
2003
15 years 9 months ago
Loosely Tree-Based Alignment for Machine Translation
We augment a model of translation based on re-ordering nodes in syntactic trees in order to allow alignments not conforming to the original tree structure, while keeping computati...
Daniel Gildea
IC
2003
15 years 9 months ago
Marshalgen: A Package for Semi-Automatic Marshaling of Objects
Abstract— Marshaling or serialization of objects is an important component of both distributed and parallel computing. Current systems impose a significant burden on the program...
Gene Cooperman, Ning Ke, Huanmei Wu