Sciweavers

2693 search results - page 10 / 539
» French Order Without Order
Sort
View
EACL
2006
ACL Anthology
13 years 9 months ago
Lexicalising Word Order Constraints for Implemented Linearisation Grammar
This paper presents a way in which a lexicalised HPSG grammar can handle word order constraints in a computational parsing system, without invoking an additional layer of represen...
Yo Sato
CIE
2007
Springer
14 years 1 months ago
Binary Trees and (Maximal) Order Types
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
Gyesik Lee
NOSSDAV
2005
Springer
14 years 1 months ago
Using n-trees for scalable event ordering in peer-to-peer games
We are concerned with the fundamental problem of event ordering in multiplayer peer-to-peer games. Event ordering, even without faults, requires all-to-all message passing with at...
Chris GauthierDickey, Virginia Mary Lo, Daniel Zap...
MOC
2002
98views more  MOC 2002»
13 years 7 months ago
Avoiding the order reduction of Runge-Kutta methods for linear initial boundary value problems
Abstract. A new strategy to avoid the order reduction of Runge-Kutta methods when integrating linear, autonomous, nonhomogeneous initial boundary value problems is presented. The s...
Mari Paz Calvo, Cesar Palencia
CTRSA
2010
Springer
172views Cryptology» more  CTRSA 2010»
14 years 2 months ago
Revisiting Higher-Order DPA Attacks:
Security devices are vulnerable to side-channel attacks that perform statistical analysis on data leaked from cryptographic computations. Higher-order (HO) attacks are a powerful a...
Benedikt Gierlichs, Lejla Batina, Bart Preneel, In...