Sciweavers

3653 search results - page 130 / 731
» On Recognizable Timed Languages
Sort
View
APLAS
2009
ACM
15 years 2 months ago
Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP...
Hongfei Fu
LREC
2008
134views Education» more  LREC 2008»
14 years 11 months ago
GMT to +2 or how can TimeML be used in Romanian
The paper describes the construction and usage of the Romanian version of the TimeBank corpus. The success rate of 96.53% for the automatic import of the temporal annotation from ...
Corina Forascu
WSDM
2009
ACM
113views Data Mining» more  WSDM 2009»
15 years 4 months ago
Time Will Tell: Leveraging Temporal Expressions in IR
Temporal expressions, such as between 1992 and 2000, are frequent across many kinds of documents. Text retrieval, though, treats them as common terms, thus ignoring their inherent...
Irem Arikan, Srikanta J. Bedathur, Klaus Berberich
FPL
2007
Springer
190views Hardware» more  FPL 2007»
15 years 4 months ago
The ANDRES Project: Analysis and Design of Run-Time Reconfigurable, Heterogeneous Systems
Today’s heterogeneous embedded systems combine components from different domains, such as software, analogue hardware and digital hardware. The design and implementation of thes...
Andreas Herrholz, Frank Oppenheimer, Philipp A. Ha...
CC
2005
Springer
123views System Software» more  CC 2005»
15 years 3 months ago
XML Goes Native: Run-Time Representations for Xtatic
Abstract. Xtatic is a lightweight extension of C offering native support for statically typed XML processing. XML trees are built-in values in Xtatic, and static analysis of the t...
Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pi...