83 search results - page 9 / 17 » Enumeration of Regular Triangulations |
CDC
2009
IEEE
14 years 3 days ago
2009
IEEE
— In this paper we use bilevel programming to find the maximum difference between a reference controller and a low-complexity controller in terms of the infinitynorm difference...
ECCC
2008
13 years 7 months ago
2008
Higman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the sta...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Most state-of-the-art nonrigid shape recovery methods
usually use explicit deformable mesh models to regularize
surface deformation and constrain the search space. These
triangu...
IPL
2006
13 years 7 months ago
2006
In this paper we investigate P systems whose compartments contain sets of symbolobjects rather than multisets of objects, as it is common in membrane computing. If the number of m...