Sciweavers

30 search results - page 2 / 6
» Code Completion from Abbreviated Input
Sort
View
BIOADIT
2006
Springer
13 years 9 months ago
Attractor Memory with Self-organizing Input
We propose a neural network based autoassociative memory system for unsupervised learning. This system is intended to be an example of how a general information processing architec...
Christopher Johansson, Anders Lansner
JSA
2000
175views more  JSA 2000»
13 years 5 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd
ICDE
2003
IEEE
120views Database» more  ICDE 2003»
14 years 7 months ago
PBiTree Coding and Efficient Processing of Containment Joins
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
FOCS
2000
IEEE
13 years 10 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
ACSAC
2007
IEEE
14 years 4 days ago
Quarantining Untrusted Entities: Dynamic Sandboxing Using LEAP
Jails, Sandboxes and other isolation mechanisms limit the damage from untrusted programs by reducing a process’s privileges to the minimum. Sandboxing is designed to thwart such...
Manigandan Radhakrishnan, Jon A. Solworth