1243 search results - page 24 / 249 » Complexity reduction of C-Algorithm |
FUIN
2002
15 years 1 months ago
2002
We use information entropy measure to extend the rough set based notion of a reduct. We introduce the Approximate Entropy Reduction Principle (AERP). It states that any simplificat...
121
click to vote
CRYPTO
2007
Springer
15 years 7 months ago
2007
Springer
To date the NTRUEncrypt security parameters have been based on the existence of two types of attack: a meet-in-the-middle attack due to Odlyzko, and a conservative extrapolation of...
ENTCS
2010
15 years 1 months ago
2010
Molecular biological models usually suffer from a large combinatorial explosion. Indeed, proteins form complexes and modify each others, which leads to the formation of a huge num...
137
click to vote
DIMVA
2004
15 years 2 months ago
2004
: Large Critical Complex Infrastructures are increasingly dependent on IP networks. Reliability by redundancy and tolerance are an imperative for such dependable networks. In order...
105
click to vote
ICCAD
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...