933 search results - page 79 / 187 » A Fully Automatic hp-Adaptivity |
SAC
2005
ACM
15 years 6 months ago
2005
ACM
The realization of the Semantic Web requires the widespread availability of semantic annotations for existing and new documents on the Web. Semantic annotations are to tag ontolog...
100
click to vote
TSD
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This paper presents a brand-new Slovak text-to-speech system. It was developed within the framework of ARTIC system (primarily designed to synthesize Czech speech) with r...
107
click to vote
PLDI
2010
ACM
15 years 4 months ago
2010
ACM
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
98
Voted
ICFP
2007
ACM
15 years 4 months ago
2007
ACM
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...
89
Voted
MICAI
2000
Springer
15 years 4 months ago
2000
Springer
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...