787 search results - page 32 / 158 » Polynomial Constants are Decidable |
STOC
2000
ACM
14 years 11 days ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
STACS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
APLAS
2005
ACM
14 years 1 months ago
2005
ACM
Affine size-change analysis has been used for termination analysis of eager functional programming languages. The same style of analysis is also capable of compactly recording and ...
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
Number Decision Diagrams (NDD) are the automatabased symbolic representation for manipulating sets of integer vectors encoded as strings of digit vectors (least or most significa...
PAMI
2010
13 years 6 months ago
2010
—Representing 2D and 3D data sets with implicit polynomials (IPs) has been attractive because of its applicability to various computer vision issues. Therefore, many IP fitting m...