Sciweavers

8874 search results - page 198 / 1775
» A New Implementation of Automath
Sort
View
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
14 years 7 months ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda
IACR
2011
135views more  IACR 2011»
14 years 4 months ago
Charm: A framework for Rapidly Prototyping Cryptosystems
We describe Charm, an extensible framework designed for rapid prototyping of cryptographic systems that utilize the latest advances in cryptography, such as identity and attribute...
Joseph A. Akinyele, Matthew Green, Aviel D. Rubin
BIRTHDAY
2012
Springer
14 years 3 days ago
Masking with Randomized Look Up Tables - Towards Preventing Side-Channel Attacks of All Orders
We propose a new countermeasure to protect block ciphers implemented in leaking devices, at the intersection between One-Time Programs and Boolean masking schemes. First, we show t...
François-Xavier Standaert, Christophe Petit...
SIGCSE
2012
ACM
310views Education» more  SIGCSE 2012»
13 years 12 months ago
CSTutor: a pen-based tutor for data structure visualization
We present CSTutor, a sketch-based interface designed to help students understand data structures. It currently supports Linked Lists, Binary Search Trees, AVL Trees, and Heaps, a...
Sarah Buchanan, Brandon Ochs, Joseph J. LaViola Jr...
FROCOS
2000
Springer
15 years 8 months ago
Compiling Multi-Paradigm Declarative Programs into Prolog
This paper describes a high-level implementation of the concurrent constraint functional logic language Curry. The implementation, directed by the lazy pattern matching strategy of...
Sergio Antoy, Michael Hanus