Sciweavers

2432 search results - page 384 / 487
» Cryptographic logical relations
Sort
View
ICCAD
2004
IEEE
125views Hardware» more  ICCAD 2004»
16 years 1 months ago
Temporal floorplanning using the T-tree formulation
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang
ICDAR
2009
IEEE
15 years 11 months ago
User-Guided Wrapping of PDF Documents Using Graph Matching Techniques
There are a number of established products on the market for wrapping—semi-automatic navigation and extraction of data—from web pages. These solutions make use of the inherent...
Tamir Hassan
IWMM
2009
Springer
122views Hardware» more  IWMM 2009»
15 years 11 months ago
Parametric heap usage analysis for functional programs
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...
Leena Unnikrishnan, Scott D. Stoller
PKDD
2009
Springer
149views Data Mining» more  PKDD 2009»
15 years 11 months ago
Learning to Disambiguate Search Queries from Short Sessions
Web searches tend to be short and ambiguous. It is therefore not surprising that Web query disambiguation is an actively researched topic. To provide a personalized experience for ...
Lilyana Mihalkova, Raymond J. Mooney
RTA
2009
Springer
15 years 11 months ago
YAPA: A Generic Tool for Computing Intruder Knowledge
Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages...
Mathieu Baudet, Véronique Cortier, St&eacut...