Sciweavers

1578 search results - page 297 / 316
» Algorithmic randomness of continuous functions
Sort
View
IS
2010
13 years 7 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
DATE
2007
IEEE
107views Hardware» more  DATE 2007»
14 years 3 months ago
Routing table minimization for irregular mesh NoCs
The majority of current Network on Chip (NoC) architectures employ mesh topology and use simple static routing, to reduce power and area. However, regular mesh topology is unreali...
Evgeny Bolotin, Israel Cidon, Ran Ginosar, Avinoam...
EUROCRYPT
2004
Springer
14 years 2 months ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
ICCAD
1999
IEEE
81views Hardware» more  ICCAD 1999»
14 years 27 days ago
Modeling design constraints and biasing in simulation using BDDs
Constraining and input biasing are frequently used techniques in functional verification methodologies based on randomized simulation generation. Constraints confine the simulatio...
Jun Yuan, Kurt Shultz, Carl Pixley, Hillel Miller,...
FLAIRS
2004
13 years 10 months ago
Recurrent Neural Networks and Pitch Representations for Music Tasks
We present results from experiments in using several pitch representations for jazz-oriented musical tasks performed by a recurrent neural network. We have run experiments with se...
Judy A. Franklin