Sciweavers

436 search results - page 59 / 88
» A Note on Negligible Functions
Sort
View
JODL
2006
136views more  JODL 2006»
14 years 9 months ago
MIT's CWSpace project: packaging metadata for archiving educational content in DSpace
This paper describes work in progress on the research project CWSpace, sponsored by the MIT and Microsoft Research iCampus program, to investigate the metadata standards and protoc...
William Reilly, Robert Wolfe, MacKenzie Smith
ACNS
2009
Springer
193views Cryptology» more  ACNS 2009»
15 years 4 months ago
Cryptanalysis of Twister
In this paper, we present a pseudo-collision attack on the compression function of all Twister variants (224,256,384,512) with complexity of about 226.5 compression function evalua...
Florian Mendel, Christian Rechberger, Martin Schl&...
ICDCS
2007
IEEE
15 years 4 months ago
Automated Storage Reclamation Using Temporal Importance Annotations
This work focuses on scenarios that require the storage of large amounts of data. Such systems require the ability to either continuously increase the storage space or reclaim spa...
Surendar Chandra, Ashish Gehani, Xuwen Yu
ITC
1998
IEEE
94views Hardware» more  ITC 1998»
15 years 2 months ago
A method of serial data jitter analysis using one-shot time interval measurements
A method for measuring inter-symbol interference, duty cycle distortion, random jitter and periodic jitter is described. The Blackman-Tukey method of signal analysis is used. This...
Jan B. Wilstrup
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
14 years 11 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou