1204 search results - page 100 / 241 » Termination of Polynomial Programs |
181
click to vote
ALT
1995
Springer
15 years 10 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
147
click to vote
IMAGING
2004
15 years 7 months ago
2004
In this study, the problem of updating a printer characterization in response to systematic changes in print-device characteristics is addressed with two distinct approaches: the ...
155
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
Tight connections between leafs languages and strings compressed via straight-line programs (SLPs) are established. It is shown that the compressed membership problem for a languag...
175
click to vote
PTS
2010
15 years 4 months ago
2010
We present an application of learning-based testing to the problem of automated test case generation (ATCG) for numerical software. Our approach uses n-dimensional polynomial model...
154
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
By using Semi-Definite Programming (SDP) as a tool, a new deign for Two-Dimensional (2-D) Diamond-Shaped (DS) filters is developed. Surprisingly, the diamond shape of the filter is...