Sciweavers

57 search results - page 9 / 12
» On Stateless Automata and P Systems
Sort
View
VLSISP
2008
140views more  VLSISP 2008»
13 years 7 months ago
Regular Expression Matching in Reconfigurable Hardware
In this paper we describe a regular expression pattern matching approach for reconfigurable hardware. Following a Non-deterministic Finite Automata direction, we introduce three ne...
Ioannis Sourdis, João Bispo, João M....
ASWC
2009
Springer
13 years 5 months ago
SHARE: A Semantic Web Query Engine for Bioinformatics
Driven by the goal of automating data analyses in the field of bioinformatics, SHARE (Semantic Health and Research Environment) is a specialized SPARQL engine that resolves queries...
Benjamin P. Vandervalk, E. Luke McCarthy, Mark D. ...
FSTTCS
2004
Springer
14 years 26 days ago
Visibly Pushdown Games
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
Christof Löding, P. Madhusudan, Olivier Serre
VMCAI
2005
Springer
14 years 28 days ago
On the Complexity of Error Explanation
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
Nirman Kumar, Viraj Kumar, Mahesh Viswanathan
VLDB
1993
ACM
112views Database» more  VLDB 1993»
13 years 11 months ago
Specifying and Enforcing Intertask Dependencies
Extensions of the traditional atomic transaction model are needed to support the development of multi-system applications or work ows that access heterogeneous databases and legac...
Paul C. Attie, Munindar P. Singh, Amit P. Sheth, M...