Sciweavers

2430 search results - page 273 / 486
» Computing Tutte Polynomials
Sort
View
128
Voted
STACS
2001
Springer
15 years 8 months ago
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
It is well known that finite square matrices over a Kleene algebra again form a Kleene algebra. This is also true for infinite matrices under suitable restrictions. One can use t...
Dexter Kozen
120
Voted
IPPS
2000
IEEE
15 years 8 months ago
Complexity Bounds for Lookup Table Implementation of Factored Forms in FPGA Technology Mapping
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs, such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
Wenyi Feng, Fred J. Meyer, Fabrizio Lombardi
PG
2000
IEEE
15 years 8 months ago
Interpolating and Approximating Moving Frames Using B-splines
The representation of moving geometry entities is an important issue in the fields of CAD/CAM and robotics motion design. We present a method to interpolate the moving frame homog...
Lizhuang Ma, Tony K. Y. Chan, Zhongding Jiang
130
Voted
FOCS
1999
IEEE
15 years 8 months ago
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
We show that no Markovian Coupling argument can prove rapid mixing of the Jerrum-Sinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect match...
V. S. Anil Kumar, H. Ramesh
SMI
1999
IEEE
116views Image Analysis» more  SMI 1999»
15 years 8 months ago
Intersecting Surfaces of Special Types
We present efficient and robust algorithms for intersecting a freeform surface with a ringed surface or a ruled surface. A ringed surface is given as a one-parameter family of cir...
Myung-Soo Kim