Sciweavers

2200 search results - page 278 / 440
» The Generalized Pignistic Transformation
Sort
View
POPL
2006
ACM
16 years 4 months ago
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
Xavier Leroy
ICFP
2008
ACM
16 years 4 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
135
Voted
DCC
2008
IEEE
16 years 3 months ago
Simultaneous Encryption/Compression of Images Using Alpha Rooting
Significant work has been done in the areas of image encryption and compression as two independent problems, yet the two areas are strongly interleaved and should be considered si...
Eric J. Wharton, Karen Panetta, Sos S. Agaian
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
16 years 1 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 1 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...