Sciweavers

3809 search results - page 250 / 762
» Associative language descriptions
Sort
View
203
Voted
USENIX
2000
15 years 8 months ago
FiST: A Language for Stackable File Systems
Traditional file system development is difficult. Stackable file systems promise to ease the development of file systems by offering a mechanism for incremental development. Unfor...
Erez Zadok, Jason Nieh
CC
2007
Springer
121views System Software» more  CC 2007»
15 years 6 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
SEMWEB
2010
Springer
15 years 4 months ago
Supporting Natural Language Processing with Background Knowledge: Coreference Resolution Case
Systems based on statistical and machine learning methods have been shown to be extremely effective and scalable for the analysis of large amount of textual data. However, in the r...
Volha Bryl, Claudio Giuliano, Luciano Serafini, Ka...
CIKM
2010
Springer
15 years 4 months ago
A probabilistic topic-connection model for automatic image annotation
The explosive increase of image data on Internet has made it an important, yet very challenging task to index and automatically annotate image data. To achieve that end, sophistic...
Xin Chen, Xiaohua Hu, Zhongna Zhou, Caimei Lu, Gai...
BIRTHDAY
2004
Springer
16 years 2 days ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer