Sciweavers

3001 search results - page 74 / 601
» Recursive type generativity
Sort
View
SODA
2003
ACM
81views Algorithms» more  SODA 2003»
15 years 1 months ago
Smaller explicit superconcentrators
d Abstract) N. Alon ∗ M. Capalbo † July 28, 2002 Using a new recursive technique, we present an explicit construction of an infinite family of N-superconcentrators of density...
Noga Alon, Michael R. Capalbo
OOPSLA
2007
Springer
15 years 6 months ago
Component nextgen: a sound and expressive component framework for java
Developing a general component system for a statically typed, object-oriented language is a challenging design problem for two reasons. First, mutually recursive references across...
James Sasitorn, Robert Cartwright
POPL
2006
ACM
16 years 6 days ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer
COLT
2003
Springer
15 years 5 months ago
Learning All Subfunctions of a Function
Sublearning, a model for learning of subconcepts of a concept, is presented. Sublearning a class of total recursive functions informally means to learn all functions from that cla...
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen
IJNSEC
2010
143views more  IJNSEC 2010»
14 years 6 months ago
Nonce Generation For The Digital Signature Standard
Digital Signature Algorithm (DSA) is an underlying algorithm to form a signature in the Digital Signature Standard (DSS). DSA uses a new random number (or nonce) each time a signa...
Rajendra S. Katti, Rajesh G. Kavasseri