Sciweavers

4498 search results - page 346 / 900
» How to Invent Functions
Sort
View
292
Voted
POPL
2009
ACM
16 years 7 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
WIDM
2006
ACM
16 years 6 days ago
Coarse-grained classification of web sites by their structural properties
In this paper, we identify and analyze structural properties which reflect the functionality of a Web site. These structural properties consider the size, the organization, the co...
Christoph Lindemann, Lars Littig
MSS
2005
IEEE
112views Hardware» more  MSS 2005»
15 years 12 months ago
Violin: A Framework for Extensible Block-Level Storage
Storage virtualization is becoming more and more important due to the increasing gap between application requirements and the limited functionality offered by storage systems. In...
Michail Flouris, Angelos Bilas
ASIACRYPT
2004
Springer
15 years 11 months ago
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
Craig Gentry, Zulfikar Ramzan
ISORC
2002
IEEE
15 years 11 months ago
Handling Aperiodic Tasks in Diverse Real-Time Systems via Plug-Ins
Functionality for various services of scheduling algorithms is typically provided as extensions to a basic algorithm. Aperiodic task handling, guarantees, etc., are integrated wit...
Tomas Lennvall, Gerhard Fohler, Björn Lindber...