scispace - formally typeset
Search or ask a question
Institution

Turku Centre for Computer Science

FacilityTurku, Finland
About: Turku Centre for Computer Science is a facility organization based out in Turku, Finland. It is known for research contribution in the topics: Decidability & Word (group theory). The organization has 382 authors who have published 1027 publications receiving 19560 citations.


Papers
More filters
Proceedings ArticleDOI
04 Jul 2011
TL;DR: An efficient hybridization architecture to optimize power consumption and system performance of Hybrid NoC-Bus 3D mesh is proposed, benefiting from a low-power congestion-aware routing algorithm for vertical communication.
Abstract: In this work, an efficient hybridization architecture to optimize power consumption and system performance of Hybrid NoC-Bus 3D mesh is proposed. Hybrid NoC-Bus 3D mesh is a feasible architecture which takes advantage of the short inter-layer wiring delays, while suffering from inefficient intermediate buffers. To address this issue, we propose a mechanism benefiting from a low-power congestion-aware routing algorithm for vertical communication. Our extensive simulations demonstrate significant power and performance improvements compared to a typical Hybrid NoC-Bus 3D architecture.

1 citations

Journal ArticleDOI
TL;DR: All standard words occurring in any characteristic word (and so in any Sturmian word) are characterized using firstly morphisms, then standard prefixes and finally palindromes.
Abstract: Among the various ways to construct a characteristic Sturmian word, one of the most used consists in defining an infinite sequence of prefixes that are standard. Nevertheless in any characteristic word c, some standard words occur that are not prefixes of c. We characterize all standard words occurring in any characteristic word (and so in any Sturmian word) using firstly morphisms, then standard prefixes and finally palindromes.

1 citations

Proceedings ArticleDOI
01 Dec 2009
TL;DR: Techniques are presented for reducing the performance overhead of switch instructions in a multicore hardware-accelerated Java virtual machine and various techniques for performing a key search in lookup switches are also evaluated.
Abstract: Techniques are presented for reducing the performance overhead of switch instructions in a multicore hardware-accelerated Java virtual machine The bytecode instruction set is extended with two new instructions suitable for hardware implementation and the complicated switch instructions are converted in the software portion of the virtual machine into series of hardware-implemented instructions using these extensions The performance, logic and memory usage impact of this technique is evaluated and compared with a pure software implementation Various techniques for performing a key search in lookup switches are also evaluated

1 citations

Journal ArticleDOI
TL;DR: This work investigates the complexity of basic decidable cases of the commutation problem for languages: testing the equality XY = YX for two languages X and Y and shows that it varies from co-NEXPTIME complete through PSPACE complete and co-NP complete to deterministic polynomial time.

1 citations

Posted Content
TL;DR: In this article, the authors introduce the notation of weighted interval-valued possibilistic mean value of fuzzy numbers and investigate its relationship to the intervalvalued probabilistic mean.
Abstract: Dubois and Prade defined an interval-valued expectation of fuzzy numbers, viewing them as consonant random sets. Carlsson and Fuller defined an interval-valued mean value of fuzzy numbers, viewing them as possibility distributions. In this paper we shall introduce the notation of weighted interval-valued possibilistic mean value of fuzzy numbers and investigate its relationship to the interval-valued probabilistic mean. We shall also introduce the notations of crisp weighted possibilistic mean value, variance and covariance of fuzzy numbers, which are consistent with the extension principle. Furthermore, we show that the weighted variance of linear combination of fuzzy numbers can be computed in a similar manner as in probability theory.

1 citations


Authors

Showing all 383 results

NameH-indexPapersCitations
José A. Teixeira101141447329
Cunsheng Ding6125411116
Jun'ichi Tsujii5938915985
Arto Salomaa5637417706
Tero Aittokallio522718689
Risto Lahdelma481496637
Hannu Tenhunen4581911661
Mats Gyllenberg442048029
Sampo Pyysalo421538839
Olli Polo421405303
Pasi Liljeberg403066959
Tapio Salakoski382317271
Filip Ginter371567294
Robert Fullér371525848
Juha Plosila353424917
Network Information
Related Institutions (5)
Vienna University of Technology
49.3K papers, 1.3M citations

84% related

Eindhoven University of Technology
52.9K papers, 1.5M citations

83% related

Aalto University
32.6K papers, 829.6K citations

83% related

Carnegie Mellon University
104.3K papers, 5.9M citations

82% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20231
20223
20213
20209
20198
201816