Sciweavers

199 search results - page 12 / 40
» Implementing Circularity Using Partial Evaluation
Sort
View
COCOON
2001
Springer
14 years 2 months ago
PC-Trees vs. PQ-Trees
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
Wen-Lian Hsu
LREC
2010
135views Education» more  LREC 2010»
13 years 11 months ago
Partial Dependency Parsing for Irish
In this paper we present a partial dependency parser for Irish, in which Constraint Grammar (CG) rules are used to annotate dependency relations and grammatical functions in unres...
Elaine Uí Dhonnchadha, Josef van Genabith
ASIACRYPT
2003
Springer
14 years 3 months ago
The Insecurity of Esign in Practical Implementations
Provable security usually makes the assumption that a source of perfectly random and secret data is available. However, in practical applications, and especially when smart cards a...
Pierre-Alain Fouque, Nick Howgrave-Graham, Gwena&e...
NSDI
2010
13 years 11 months ago
Maranello: Practical Partial Packet Recovery for 802.11
Partial packet recovery protocols attempt to repair corrupted packets instead of retransmitting them in their entirety. Recent approaches have used physical layer confidence estim...
Bo Han, Aaron Schulman, Francesco Gringoli, Neil S...
SNPD
2003
13 years 11 months ago
Incomplete Information Processing for Optimization of Distributed Applications
This paper focuses on non-strict processing, optimization, and partial evaluation of MPI programs which use incremental data structures (ISs). We describe the design and implement...
Alfredo Cristóbal-Salas, Andrei Tchernykh, ...