Sciweavers

4037 search results - page 79 / 808
» Routing without ordering
Sort
View
CN
2007
97views more  CN 2007»
13 years 9 months ago
A longest prefix first search tree for IP lookup
- One of the key design issues for IP routers is the IP Lookup mechanism. IP lookup is an important action in router that is to find the next hop of each incoming packet with a lon...
Lih-Chyau Wuu, Tzong-Jye Liu, Kuo-Ming Chen
NOSSDAV
2005
Springer
14 years 2 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...
EACL
2006
ACL Anthology
13 years 10 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
CTRSA
2010
Springer
172views Cryptology» more  CTRSA 2010»
14 years 3 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...
CIE
2007
Springer
14 years 3 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