Sciweavers

1701 search results - page 200 / 341
» Computer Science and State Machines
Sort
View
STACS
1994
Springer
15 years 2 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman
ACSC
2004
IEEE
15 years 1 months ago
Exploiting FPGA Concurrency to Enhance JVM Performance
The Java Programming Language has been praised for its platform independence and portability, but because of its slow execution speed on a software Java Virtual Machine (JVM), som...
James Parnis, Gareth Lee
89
Voted
DIS
2004
Springer
15 years 1 months ago
Extracting Positive Attributions from Scientific Papers
The aim of our work is to provide support for reading (or skimming) scientific papers. In this paper we report on the task to identify concepts or terms with positive attributions ...
Son Bao Pham, Achim G. Hoffmann
DIS
2006
Springer
15 years 1 months ago
Optimal Bayesian 2D-Discretization for Variable Ranking in Regression
In supervised machine learning, variable ranking aims at sorting the input variables according to their relevance w.r.t. an output variable. In this paper, we propose a new relevan...
Marc Boullé, Carine Hue
CSR
2009
Springer
15 years 1 months ago
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
Olaf Beyersdorff, Zenon Sadowski