Sciweavers

1445 search results - page 25 / 289
» Uniformly Hard Languages
Sort
View
MST
2008
101views more  MST 2008»
13 years 7 months ago
Realizability interpretation of proofs in constructive analysis
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
Helmut Schwichtenberg
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
13 years 8 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
ECOOP
1992
Springer
13 years 11 months ago
An Object-Oriented Language-Database Integration Model: The Composition-Filters Approach
This paper introduces a new model, based on so-called object-composition filters, that uniformly integrates database-like features into an object-oriented language. The focus is o...
Mehmet Aksit, Lodewijk Bergmans, Sinan Vural
TOOLS
1997
IEEE
13 years 12 months ago
JBCDL: An Object-Oriented Component Description Language
This paper introduces Jade Bird Component Description Language (JBCDL) which is a part of Jade Bird Component Library (JBCL). JBCDL is based on Jade Bird Component Model (JBCOM). ...
Qiong Wu, Jichuan Chang, Hong Mei, Fuqing Yang
TREC
2004
13 years 9 months ago
Conceptual Language Models for Context-Aware Text Retrieval
While participating in the HARD track our first question was, what an IR-application should look like that takes into account preference meta-data from the user, without the need ...
Henning Rode, Djoerd Hiemstra