Sciweavers

1070 search results - page 68 / 214
» Type Classes with Functional Dependencies
Sort
View
COLT
2001
Springer
14 years 7 days ago
Robust Learning - Rich and Poor
A class C of recursive functions is called robustly learnable in the sense I (where I is any success criterion of learning) if not only C itself but even all transformed classes Ī...
John Case, Sanjay Jain, Frank Stephan, Rolf Wiehag...
IANDC
2007
106views more  IANDC 2007»
13 years 7 months ago
Tyrolean termination tool: Techniques and features
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new reļ¬nements of the dependen...
Nao Hirokawa, Aart Middeldorp
POPL
2006
ACM
14 years 8 months ago
The next 700 data description languages
In the spirit of Landin, we present a calculus of dependent types to serve as the semantic foundation for a family of languages called data description languages. Such languages, ...
Kathleen Fisher, Yitzhak Mandelbaum, David Walker
GLOBECOM
2006
IEEE
14 years 1 months ago
A Field Study on Terrestrial and Satellite Location Sources for Urban Cellular Networks
ā€” This work presents a statistical field study of the availability of time sources for location in a true wireless network. Terrestrial (base stations) and satellite (GPS) source...
Israel Martín-Escalona, Francisco Barcel&oa...
FSE
2005
Springer
106views Cryptology» more  FSE 2005»
14 years 1 months ago
New Applications of T-Functions in Block Ciphers and Hash Functions
A T-function is a mapping from n-bit words to n-bit words in which for each 0 ā‰¤ i < n, bit i of any output word can depend only on bits 0, 1, . . . , i of any input word. All ...
Alexander Klimov, Adi Shamir