3244 search results - page 200 / 649 » On convex complexity measures |
148
Voted
IPL
2006
15 years 6 months ago
2006
Counting the number of distinct factors in the words of a language gives a measure of complexity for that language similar to the factor-complexity of infinite words. Similarly as ...
175
click to vote
JALC
2007
15 years 6 months ago
2007
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
154
click to vote
SIAMMA
2011
15 years 1 months ago
2011
We develop a reconstruction algorithm to determine penetrable obstacles inside a domain in the plane from acoustic measurements made on the boundary. This algorithm uses complex g...
129
click to vote
PNPM
1989
15 years 10 months ago
1989
We present SPNP, a powerful GSPN package developed at Duke University. SPNP allows the modeling of complex system behaviors. Advanced constructs are available, such as markingdepe...
167
click to vote
CGI
2004
IEEE
15 years 10 months ago
2004
IEEE
Rendering geometric models with complex surface materials in arbitrary lighting environments is a challenging problem. In order to relight and render geometries covered with compl...