Sciweavers

756 search results - page 53 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
SCP
1998
163views more  SCP 1998»
13 years 7 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
EUROCOLT
1995
Springer
13 years 11 months ago
The structure of intrinsic complexity of learning
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
Sanjay Jain, Arun Sharma
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 8 months ago
Combining decision procedures for the reals
Abstract. We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consi...
Jeremy Avigad, Harvey Friedman
IJCNLP
2005
Springer
14 years 1 months ago
Two-Phase Biomedical Named Entity Recognition Using A Hybrid Method
Biomedical named entity recognition (NER) is a difficult problem in biomedical information processing due to the widespread ambiguity of terms out of context and extensive lexical ...
Seonho Kim, Juntae Yoon, Kyung-Mi Park, Hae-Chang ...
WSC
2007
13 years 10 months ago
Representation and simulation of stochastic petrinet models using xPNML
The paper presents an extensible Petri Net Markup Language (xPNML), which is an extended version of PNML. The xPNML format overcomes limitations associated with PNML structure for...
Hyunsoo Lee, Bikram Sharda, Amarnath Banerjee