54 search results - page 1 / 11 » Efficient Solution of Language Equations Using Partitioned R... |
DATE
2005
IEEE
15 years 3 months ago
2005
IEEE
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...
92
Voted
CVPR
2004
IEEE
16 years 7 days ago
2004
IEEE
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...
108
Voted
EC
2008
14 years 9 months ago
2008
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...
SCAM
2002
IEEE
15 years 3 months ago
2002
IEEE
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...
DCC
2005
IEEE
15 years 9 months ago
2005
IEEE
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...