28 search results - page 6 / 6 » Constructions and bounds for (m, t)-splitting systems |
CORR
2010
Springer
13 years 3 days ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
POPL
2008
ACM
14 years 5 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
DRR
2010
13 years 7 months ago
2010
Scaling up document-image classifiers to handle an unlimited variety of document and image types poses serious challenges to conventional trainable classifier technologies. Highly...