Sciweavers

3653 search results - page 444 / 731
» On Recognizable Timed Languages
Sort
View
ESWS
2006
Springer
15 years 10 months ago
PowerAqua: Fishing the Semantic Web
The Semantic Web (SW) offers an opportunity to develop novel, sophisticated forms of question answering (QA). Specifically, the availability of distributed semantic markup on a lar...
Vanessa Lopez, Enrico Motta, Victoria S. Uren
EUROPAR
2006
Springer
15 years 10 months ago
An Embedded Systems Programming Environment for C
Resource constraints are a major concern with the design, development, and deployment of embedded systems. Embedded systems are highly hardware-dependent and have little computatio...
Bernd Burgstaller, Bernhard Scholz, M. Anton Ertl
FSTTCS
2006
Springer
15 years 10 months ago
Some Results on Average-Case Hardness Within the Polynomial Hierarchy
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran
GFKL
2006
Springer
78views Data Mining» more  GFKL 2006»
15 years 10 months ago
Putting Successor Variety Stemming to Work
Stemming algorithms find canonical forms for inflected words, e. g. for declined nouns or conjugated verbs. Since such a unification of words with respect to gender, number, time, ...
Benno Stein, Martin Potthast
CASES
2001
ACM
15 years 10 months ago
A compiler framework for mapping applications to a coarse-grained reconfigurable computer architecture
The rapid growth of silicon densities has made it feasible to deploy reconfigurable hardware as a highly parallel computing platform. However, in most cases, the application needs...
Girish Venkataramani, Walid A. Najjar, Fadi J. Kur...