Sciweavers

892 search results - page 46 / 179
» et 2007
Sort
View
EMNLP
2007
13 years 10 months ago
A Constraint Satisfaction Approach to Dependency Parsing
We present an adaptation of constraint satisfaction inference (Canisius et al., 2006b) for predicting dependency trees. Three different classifiers are trained to predict weighte...
Sander Canisius, Erik Tjong Kim Sang
ICISC
2007
96views Cryptology» more  ICISC 2007»
13 years 10 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
ACL
2003
13 years 10 months ago
Parsing with Generative Models of Predicate-Argument Structure
The model used by the CCG parser of Hockenmaier and Steedman (2002b) would fail to capture the correct bilexical dependencies in a language with freer word order, such as Dutch. T...
Julia Hockenmaier
IJCAI
2003
13 years 10 months ago
Artificial Neural Network for Sequence Learning
This poster shows an artificial neural network capable of learning a temporal sequence. Directly inspired from a hippocampus model [Banquet et al, 1998], this architecture allows ...
Sorin Moga, Philippe Gaussier
ALMOB
2006
86views more  ALMOB 2006»
13 years 9 months ago
Analysis of computational approaches for motif discovery
Recently, we performed an assessment of 13 popular computational tools for discovery of transcription factor binding sites (M. Tompa, N. Li, et al., "Assessing Computational ...
Nan Li, Martin Tompa