Sciweavers

16430 search results - page 244 / 3286
» On Computable Tree Functions
Sort
View
ACL
2009
15 years 2 months ago
Forest-based Tree Sequence to String Translation Model
This paper proposes a forest-based tree sequence to string translation model for syntaxbased statistical machine translation, which automatically learns tree sequence to string tr...
Hui Zhang, Min Zhang, Haizhou Li, AiTi Aw, Chew Li...
CVPR
2011
IEEE
15 years 20 days ago
Scale and Rotation Invariant Matching Using Linearly Augmented Trees
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...
Hao Jiang, Tai-Peng Tian, Stan Sclaroff
EUROCRYPT
2006
Springer
15 years 8 months ago
Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSRbased s...
Frederik Armknecht, Claude Carlet, Philippe Gabori...
PC
2000
105views Management» more  PC 2000»
15 years 4 months ago
New advances in chemistry and materials science with CPMD and parallel computing
A short overview is presented of the density functional theory and molecular dynamics (DFT
Wanda Andreoni, Alessandro Curioni
FUIN
2006
90views more  FUIN 2006»
15 years 4 months ago
Local Computations in Graphs: The Case of Cellular Edge Local Computations
We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its...
Jérémie Chalopin, Yves Métivi...