Sciweavers

116 search results - page 9 / 24
» Special Issue on Foundations of Computer Science
Sort
View
TLCA
1993
Springer
13 years 11 months ago
Recursive Types Are not Conservative over F
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...
Giorgio Ghelli
CAD
2004
Springer
13 years 7 months ago
A concurrent engineering-oriented design database representation model
A concurrent engineering-oriented design database representation model (CE-DDRM) is introduced in this research for supporting various life-cycle aspects in concurrent design. In ...
Deyi Xue, Haoguang Yang
JOC
2002
76views more  JOC 2002»
13 years 7 months ago
A Note on Negligible Functions
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
Mihir Bellare
FEGC
2006
92views Biometrics» more  FEGC 2006»
13 years 9 months ago
Maintaining an Online Bibliographical Database: The Problem of Data Quality
CiteSeer and Google-Scholar are huge digital libraries which provide access to (computer-)science publications. Both collections are operated like specialized search engines, they ...
Michael Ley, Patrick Reuther
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
14 years 2 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...