Sciweavers

8874 search results - page 192 / 1775
» A New Implementation of Automath
Sort
View
SIGMOD
2010
ACM
120views Database» more  SIGMOD 2010»
14 years 11 months ago
Paper bricks: an alternative to complete-story peer reviewing
The peer review system as used in several computer science communities has several flaws including long review times, overloaded reviewers, as well as fostering of niche topics. T...
Jens Dittrich
TIT
2010
124views Education» more  TIT 2010»
14 years 11 months ago
Soft-input soft-output single tree-search sphere decoding
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for prac...
Christoph Studer, Helmut Bölcskei
FOSSACS
2011
Springer
14 years 7 months ago
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
Naoki Kobayashi
ENTCS
2002
78views more  ENTCS 2002»
15 years 4 months ago
ESUIF: An Open Esterel Compiler
I describe a new compiler infrastructure for imperative synchronous languages such as Esterel and ecl. Built on the suif 2 system, it includes a new intermediate representation fo...
Stephen Edwards
ICCAD
2009
IEEE
119views Hardware» more  ICCAD 2009»
15 years 2 months ago
Iterative layering: Optimizing arithmetic circuits by structuring the information flow
Current logic synthesis techniques are ineffective for arithmetic circuits. They perform poorly for XOR-dominated circuits, and those with a high fan-in dependency between inputs ...
Ajay K. Verma, Philip Brisk, Paolo Ienne