Sciweavers

199 search results - page 35 / 40
» Natural Language Specification of Performance Trees
Sort
View
ASE
2005
137views more  ASE 2005»
13 years 7 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
IIS
2003
13 years 9 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski
LREC
2010
144views Education» more  LREC 2010»
13 years 9 months ago
Evaluating Complex Semantic Artifacts
Evaluating complex Natural Language Processing (NLP) systems can prove extremely difficult. In many cases, the best one can do is to evaluate these systems indirectly, by looking ...
Christopher R. Walker, Hannah Copperman
IRCDL
2008
13 years 9 months ago
A New Machine Learning Based Approach for Sentiment Classification of Italian documents
Several sites allow users to publish personal reviews about products and services available on the market. In this paper, we consider the problem of applying classification techniq...
Paolo Casoto, Antonina Dattolo, Paolo Omero, Nirma...
ASPDAC
2005
ACM
98views Hardware» more  ASPDAC 2005»
14 years 1 months ago
Bitwidth-aware scheduling and binding in high-level synthesis
- Many high-level description languages, such as C/C++ or Java, lack the capability to specify the bitwidth information for variables and operations. Synthesis from these specifica...
Jason Cong, Yiping Fan, Guoling Han, Yizhou Lin, J...