276 search results - page 21 / 56 » Decomposition tool for event-B |
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
ACT Maps are vital tools for most government agencies and consumers. However, their manual generation and updating is tedious and time consuming. As a step toward automatic map gen...
75
Voted
IJCV
2006
14 years 9 months ago
2006
: Linear subspace analysis (LSA) has become rather ubiquitous in a wide range of problems arising in pattern recognition and computer vision. The essence of these approaches is tha...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
82
Voted
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
90
Voted
ICCAD
2007
IEEE
2007
IEEE
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
15 years 1 months ago
Abstract: Polynomial computations over fixed-size bitvectors are found in many practical datapath designs. For efficient RTL synthesis, it is important to identify good decompositi...