Sciweavers

4218 search results - page 303 / 844
» Complete sets of cooperations
Sort
View
156
Voted
FSTTCS
2001
Springer
15 years 10 months ago
Rewrite Closure for Ground and Cancellative AC Theories
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
Ashish Tiwari
ICPR
2000
IEEE
15 years 10 months ago
Rubber Band Algorithm for Estimating the Length of Digitized Space-Curves
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
Thomas Bülow, Reinhard Klette
ICPR
2000
IEEE
15 years 10 months ago
Stochastic Error-Correcting Parsing for OCR Post-Processing
In this paper, stochastic error-correcting parsing is proposed as a powerful and flexible method to post-process the results of an optical character recognizer (OCR). Determinist...
Juan Carlos Pérez-Cortes, Juan-Carlos Ameng...
ARITH
1999
IEEE
15 years 10 months ago
Necessary and Sufficient Conditions for Parallel, Constant Time Conversion and Addition
This note presents necessary and sufficient conditions for parallel and constant time conversions from one digit-set into another, and thus also for constant time addition. In the...
Peter Kornerup
ISPD
1998
ACM
110views Hardware» more  ISPD 1998»
15 years 10 months ago
Performance-driven soft-macro clustering and placement by preserving HDL design hierarchy
In this paper, we present a performance-driven softmacro clustering and placement method which preserves HDL design hierarchy to guide the soft-macro placement process. We also pr...
Hsiao-Pin Su, Allen C.-H. Wu, Youn-Long Lin