Sciweavers

1445 search results - page 19 / 289
» Uniformly Hard Languages
Sort
View
CIKM
2011
Springer
13 years 11 months ago
Semantic data markets: a flexible environment for knowledge management
We present Nyaya, a system for the management of Semantic-Web data which couples a general-purpose and extensible storage mechanism with efficient ontology reasoning and querying ...
Roberto De Virgilio, Giorgio Orsi, Letizia Tanca, ...
DLT
2006
15 years 1 months ago
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
Hermann Gruber, Markus Holzer
JFP
2000
91views more  JFP 2000»
14 years 11 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
TON
2012
13 years 2 months ago
On New Approaches of Assessing Network Vulnerability: Hardness and Approximation
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
Thang N. Dinh, Ying Xuan, My T. Thai, Panos M. Par...
TREC
2003
15 years 1 months ago
TREC12 HARD Track at ISCAS
Statistical model in retrieval has been shown to perform well empirically. Extended Boolean model has been widely used in business system for its easiness to be complemented and n...
Zeng Wu, Lin Du, Le Sun, Shiwei Ye