Sciweavers

54 search results - page 1 / 11
» Efficient Solution of Language Equations Using Partitioned R...
Sort
View
DATE
2005
IEEE
97views Hardware» more  DATE 2005»
13 years 10 months ago
Efficient Solution of Language Equations Using Partitioned Representations
A class of discrete event synthesis problems can be reduced to solving language equations F • X ⊆ S, where F is the fixed component and S the specification. Sequential synthes...
Alan Mishchenko, Robert K. Brayton, Jie-Hong Rolan...
CVPR
2004
IEEE
14 years 7 months ago
Shape Representation and Classification Using the Poisson Equation
Silhouettes contain rich information about the shape of objects that can be used for recognition and classification. We present a novel approach that allows us to reliably compute...
Lena Gorelick, Meirav Galun, Eitan Sharon, Ronen B...
EC
2008
153views ECommerce» more  EC 2008»
13 years 4 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
SCAM
2002
IEEE
13 years 9 months ago
Semantics Guided Filtering of Combinatorial Graph Transformations in Declarative Equation-Based Languages
This paper concerns the use of static analysis for debugging purposes of declarative object-oriented equation-based modeling languages. We propose a framework where over- and unde...
Peter Bunus, Peter Fritzson
DCC
2005
IEEE
14 years 4 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said