Sciweavers

312 search results - page 47 / 63
» Restricting and Embedding Imperatives
Sort
View
CHES
2003
Springer
106views Cryptology» more  CHES 2003»
15 years 3 months ago
Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves
For most of the time since they were proposed, it was widely believed that hyperelliptic curve cryptosystems (HECC) carry a substantial performance penalty compared to elliptic cur...
Jan Pelzl, Thomas J. Wollinger, Jorge Guajardo, Ch...
COMPGEOM
2010
ACM
15 years 2 months ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar
JTRES
2009
ACM
15 years 2 months ago
A technology compatibility kit for safety critical Java
Safety Critical Java is a specification being built on top a subset of interfaces from the Real-Time Specification for Java. It is designed to ease development and analysis of s...
Lei Zhao, Daniel Tang, Jan Vitek
CODES
2000
IEEE
15 years 2 months ago
Co-design of interleaved memory systems
Memory interleaving is a cost-efficient approach to increase bandwidth. Improving data access locality and reducing memory access conflicts are two important aspects to achieve hi...
Hua Lin, Wayne Wolf
ICDCS
1998
IEEE
15 years 2 months ago
Structuring Remote Object Systems for Mobile Hosts with Intermittent Connectivity
In distributed object systems, remote method inattempts to abstract communication between di erent machines to the level of object method invocation. Link failure in such systems ...
Girish Welling, Maximilian Ott