International Symposium on Fundamentals of Computation Theory

Known as: FCT 
FCT, the International Symposia on Fundamentals of Computation Theory is a biennial series of conferences in the field of theoretical computer… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
We introduce a model for constructing vector representations of words by composing characters using bidirectional LSTMs. Relative… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
Highly Cited
2015
Highly Cited
2015
We present two simple modifications to the models in the popular Word2Vec tool, in order to generate embeddings more suited to… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2015
2015
  • Adrian Kosowski Igor Walukiewicz
  • Lecture Notes in Computer Science
  • 2015
In the past few years, more and more attention has been paid to the annoying difference between abstract algorithmic problems and… (More)
  • table 1
  • table 2
  • figure 6
  • figure 7
  • figure 10
Is this relevant?
Review
2013
Review
2013
This special issue of Information and Computation is devoted to a selection of papers presented at the 18th International… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
This paper presents an energy management method in an electrical hybrid power source (EHPS) for electric vehicular applications… (More)
  • figure 1
  • figure 2
  • table I
  • table III
  • table II
Is this relevant?
Highly Cited
2011
Highly Cited
2011
0006-3207/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.biocon.2011.07.024 ⇑ Corresponding author at: Azorean… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
. Proc. Ninth Annual ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA, pp. 394–399. ACM, New York. PARAMETERIZED COMPLEXITY… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Consider the problem of scheduling n sporadic tasks so as to meet deadlines on m identical processors. A task is characterised by… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 7
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This chapter is concerned with the design of high-resolution finite element schemes satisfying the discrete maximum principle… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The authors develop and test computational methods for advection of a scalar field that also include a minimal dissipation of its… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?