1898 search results - page 101 / 380 » Weak Keys for IDEA |
MEMOCODE
2003
IEEE
14 years 2 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
AIMS
2010
Springer
14 years 1 months ago
2010
Springer
We present a new paradigm for multicasting. Our paradigm combines two ideas: a simple distributed algorithm for automatically numbering network links with a small amount of numbers...
CIE
2010
Springer
14 years 1 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
MFCS
2001
Springer
14 years 1 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
HICSS
1999
IEEE
14 years 1 months ago
1999
IEEE
The paper introduces an Internet based development system for Xputers, which combines an application development framework with a runtime support to run applications on the real h...