Sciweavers

182 search results - page 17 / 37
» The Secret Art of Computer Programming
Sort
View
LICS
2005
IEEE
14 years 29 days ago
Generalizing Parametricity Using Information-flow
Run-time type analysis allows programmers to easily and concisely define operations based upon type structure, such as serialization, iterators, and structural equality. However,...
Geoffrey Washburn, Stephanie Weirich
ICALP
2005
Springer
14 years 27 days ago
Single-Key AIL-MACs from Any FIL-MAC
Abstract. We investigate a general paradigm for constructing arbitraryinput-length (AIL) MACs from fixed-input-length (FIL) MACs, define the waste as the relevant efficiency para...
Ueli M. Maurer, Johan Sjödin
WWW
2001
ACM
14 years 8 months ago
On representation of a highlight on the Web: the amber room as a cultural phenomenon in progress
"The Amber Room on the Web" project provides wide public access to information about the process of reconstruction of the Amber Room of the Catherine Palace outside of S...
Tatyana G. Bogomazova, Cyrill A. Malevanov
PPOPP
2012
ACM
12 years 2 months ago
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
James A. Edwards, Uzi Vishkin
BMCBI
2011
13 years 2 months ago
A discriminative method for family-based protein remote homology detection that combines inductive logic programming and proposi
Background: Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequenc...
Juliana S. Bernardes, Alessandra Carbone, Gerson Z...