Sciweavers

706 search results - page 73 / 142
» On a quasi-ordering on Boolean functions
Sort
View
SEMWEB
2007
Springer
14 years 3 months ago
Towards Fine-grained Service Matchmaking by Using Concept Similarity
Several description frameworks to semantically describe and match services on the one hand and service requests on the other have been presented in the literature. Many of the curr...
Alberto Fernández, Axel Polleres, Sascha Os...
SSC
2007
Springer
161views Cryptology» more  SSC 2007»
14 years 3 months ago
On Attacks on Filtering Generators Using Linear Subspace Structures
Abstract. The filter generator consists of a linear feedback shift register (LFSR) and a Boolean filtering function that combines some bits from the shift register to create a ke...
Sondre Rønjom, Guang Gong, Tor Helleseth
VMCAI
2005
Springer
14 years 2 months ago
Information Flow Analysis for Java Bytecode
Abstract. We present a context-sensitive compositional analysis of information flow for full (mono-threaded) Java bytecode. Our idea consists in transforming the Java bytecode int...
Samir Genaim, Fausto Spoto
ICCAD
1999
IEEE
99views Hardware» more  ICCAD 1999»
14 years 1 months ago
FunState - an internal design representation for codesign
In this paper, an internal design model called FunState (functions driven by state machines) is presented that enables the representation of different types of system components a...
Lothar Thiele, Karsten Strehl, Dirk Ziegenbein, Ro...
DATE
1998
IEEE
73views Hardware» more  DATE 1998»
14 years 1 months ago
On Removing Multiple Redundancies in Combinational Circuits
1 Redundancy removal is an important step in combinational logic optimization. After a redundant wire is removed, other originally redundant wires may become irredundant, and some ...
David Ihsin Cheng