Result 1 to 20 of 92 total
Termination proofs in the dependency pair framework May induce multiple recursive derivational complexity. (English)
Schmid-Schauß, Manfred (ed.), 22nd international conference on rewriting techniques and applications (RTA 2011), Novi Sad, Serbia, May 30 ‒ June 1, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-30-9). LIPICS ‒ Leibniz International Proceedings in Informatics 10, 235-250, electronic only (2011).
1
A path order for rewrite systems that compute exponential time functions. (English)
Schmid-Schauß, Manfred (ed.), 22nd international conference on rewriting techniques and applications (RTA 2011), Novi Sad, Serbia, May 30 ‒ June 1, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-30-9). LIPICS ‒ Leibniz International Proceedings in Informatics 10, 123-138, electronic only (2011).
2
The derivational complexity induced by the dependency pair method. (English)
Log. Methods Comput. Sci. 7, No. 3, Paper No. 1, 38 p., electronic only (2011).
3
On transfinite Knuth-Bendix orders. (English)
Bjørner, Nikolaj (ed.) et al., Automated deduction ‒ CADE-23. 23rd international conference on automated deduction, Wrocław, Poland, July 31 ‒ August 5, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22437-9/pbk). Lecture Notes in Computer Science 6803. Lecture Notes in Artificial Intelligence, 384-399 (2011).
4
Joint spectral radius theory for automated complexity analysis of rewrite systems. (English)
Winkler, Franz (ed.), Algebraic informatics. 4th international conference, CAI 2011, Linz, Austria, June 21‒24, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21492-9/pbk). Lecture Notes in Computer Science 6742, 1-20 (2011).
5
Termination proofs in the dependency pair framework May induce multiple recursive derivational complexity. (English)
Comput. Res. Repos. 2011, Article No. 1103.5082 (2011).
6
Automated complexity analysis based on the dependency pair method. (English)
Comput. Res. Repos. 2011, Article No. 1102.3129 (2011).
7
Supervised high-resolution dual-polarization SAR image classification by finite mixtures and copulas (English)
J. Sel. Topics Signal Processing 5, No. 3, 554-566 (2011).
8
Joint spectral radius theory for automated complexity analysis of rewrite systems (English)
CAI, 1-20 (2011).
9
On transfinite knuth-bendix orders (English)
CADE, 384-399 (2011).
10
A K-Wishart Markov random field model for clustering of polarimetric SAR imagery (English)
IGARSS, 1357-1360 (2011).
11
Contextual high-resolution image classification by Markovian data fusion, adaptive texture extraction, and multiscale segmentation (English)
IGARSS, 1155-1158 (2011).
12
Multitemporal region-based classification of high-resolution images by Markov random fields and multiscale segmentation (English)
IGARSS, 102-105 (2011).
13
A path order for rewrite systems that compute exponential time functions (English)
RTA, 123-138 (2011).
14
Termination proofs in the dependency pair framework May induce multiple recursive derivational complexity (English)
RTA, 235-250 (2011).
15
Closing the gap between runtime complexity and polytime computability. (English)
Lynch, Christopher (ed.), Proceedings of the 21st international conference on rewriting techniques and applications (RTA 2010), July 11‒13, 2010, Edinburgh, Scottland, UK. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-18-7). LIPICS ‒ Leibniz International Proceedings in Informatics 6, 33-48, electronic only (2010).
16
Characterising space complexity classes via Knuth-Bendix orders. (English)
Fermüller, Christian G. (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 17th international conference, LPAR-17, Yogyakarta, Indonesia, October 10‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-16241-1/pbk). Lecture Notes in Computer Science 6397, 142-156 (2010).
17
Efficient implementation of rewriting revisited technical report. (English)
Comput. Res. Repos. 2010, Article No. 1001.5404 (2010).
18
Complexity analysis by graph rewriting. (English)
Blume, Matthias (ed.) et al., Functional and logic programming. 10th international symposium, FLOPS 2010, Sendai, Japan, April 19‒21, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12250-7/pbk). Lecture Notes in Computer Science 6009, 257-271 (2010).
19
Unsupervised change-detection in retinal images by a multiple-classifier approach. (English)
El Gayar, Neamat (ed.) et al., Multiple classifier systems. 9th international workshop, MCS 2010, Cairo, Egypt, April 7‒9, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12126-5/pbk). Lecture Notes in Computer Science 5997, 94-103 (2010).
20
Result 1 to 20 of 92 total
Start
Contact
Print
General Help
