Sciweavers

656 search results - page 61 / 132
» Minimal non-convex words
Sort
View
SIGGRAPH
1994
ACM
15 years 1 months ago
Accelerated MPEG compression of dynamic polygonal scenes
This paper describes a methodology for using the matrix-vector multiply and scan conversion hardware present in many graphics workstations to rapidly approximate the optical flow ...
Dan S. Wallach, Sharma Kunapalli, Michael F. Cohen
FOCS
1990
IEEE
15 years 1 months ago
Complexity of Unification in Free Groups and Free Semi-groups
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
Antoni Koscielski, Leszek Pacholski
SAT
2010
Springer
141views Hardware» more  SAT 2010»
15 years 1 months ago
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
Carsten Fuhs, Peter Schneider-Kamp
EURODAC
1995
IEEE
127views VHDL» more  EURODAC 1995»
15 years 1 months ago
Layout synthesis for datapath designs
DPLAYOUT is a layout synthesis tool for bit-sliced datapath designs targeting standard-cell libraries. We developed fast and efficient heuristics for placing the cells in a bit-s...
Naveen Buddi, Malgorzata Chrzanowska-Jeske, Charle...
BPM
2008
Springer
122views Business» more  BPM 2008»
14 years 12 months ago
Correcting Deadlocking Service Choreographies Using a Simulation-Based Graph Edit Distance
Abstract. Many work has been conducted to analyze service choreographies to assert manyfold correctness criteria. While errors can be detected automatically, the correction of defe...
Niels Lohmann