13603 search results - page 239 / 2721 » On the Complexity of Computing Treelength |
146
click to vote
ISSAC
2005
Springer
15 years 11 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
173
click to vote
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
166
click to vote
WACV
2002
IEEE
15 years 10 months ago
2002
IEEE
3D models of urban sites with geometry and facade textures are needed for many planning and visualization applications. Approximate 3D wireframe model can be derived from aerial i...
141
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
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...
130
click to vote
DCC
1998
IEEE
15 years 10 months ago
1998
IEEE
The ITU-T H.263+ low bit-rate video coding standard is Version 2 of the draft international standard ITU-T H.263. Currently, we are a contributing party in the H.263+ standardizat...