Sciweavers

366 search results - page 58 / 74
» Four equivalent equivalences of reductions
Sort
View
ECML
2006
Springer
13 years 11 months ago
Cost-Sensitive Decision Tree Learning for Forensic Classification
Abstract. In some learning settings, the cost of acquiring features for classification must be paid up front, before the classifier is evaluated. In this paper, we introduce the fo...
Jason V. Davis, Jungwoo Ha, Christopher J. Rossbac...
ESOP
2006
Springer
13 years 11 months ago
Coinductive Big-Step Operational Semantics
Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to d...
Xavier Leroy
FOSSACS
2006
Springer
13 years 11 months ago
Register Allocation After Classical SSA Elimination is NP-Complete
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
Fernando Magno Quintão Pereira, Jens Palsbe...
FPGA
2010
ACM
181views FPGA» more  FPGA 2010»
13 years 10 months ago
Efficient multi-ported memories for FPGAs
Multi-ported memories are challenging to implement with FPGAs since the provided block RAMs typically have only two ports. We present a thorough exploration of the design space of...
Charles Eric LaForest, J. Gregory Steffan
CIE
2007
Springer
13 years 9 months ago
Constructive Dimension and Weak Truth-Table Degrees
This paper examines the constructive Hausdorff and packing dimensions of weak truth-table degrees. The main result is that every infinite sequence S with constructive Hausdorff...
Laurent Bienvenu, David Doty, Frank Stephan