Sciweavers

3653 search results - page 157 / 731
» On Recognizable Timed Languages
Sort
View
75
Voted
INDIASE
2009
ACM
15 years 2 months ago
Automated review of natural language requirements documents: generating useful warnings with user-extensible glossaries driving
We present an approach to automating some of the quality assurance review of software requirements documents, and promoting best practices for requirements documentation. The syst...
Prateek Jain, Kunal Verma, Alex Kass, Reymonrod G....
CC
2007
Springer
121views System Software» more  CC 2007»
14 years 10 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
89
Voted
ICWE
2004
Springer
15 years 3 months ago
Automatic Interpretation of Natural Language for a Multimedia E-learning Tool
Abstract. This paper describes the new e-learning tool CHESt that allows students to search in a knowledge base for short (teaching) multimedia clips by using a semantic search eng...
Serge Linckels, Christoph Meinel
87
Voted
CLEF
2007
Springer
15 years 2 months ago
Experiments in Classification Clustering and Thesaurus Expansion for Domain Specific Cross-Language Retrieval
In this paper we will describe Berkeley's approach to the Domain Specific (DS) track for CLEF 2007. This year we are using forms of the Entry Vocabulary Indexes and Thesaurus...
Ray R. Larson
81
Voted
USENIX
2008
15 years 16 days ago
LeakSurvivor: Towards Safely Tolerating Memory Leaks for Garbage-Collected Languages
Continuous memory leaks severely hurt program performance and software availability for garbage-collected programs. This paper presents a safe method, called LeakSurvivor, to tole...
Yan Tang, Qi Gao, Feng Qin