Sciweavers

347 search results - page 13 / 70
» Learning from examples to improve code completion systems
Sort
View
CLEF
2007
Springer
14 years 1 months ago
The University of Amsterdam's Question Answering System at QA@CLEF 2007
We describe a new version of our question answering system, which was applied to the questions of the 2007 CLEF Question Answering Dutch monolingual task. This year, we made three ...
Valentin Jijkoun, Katja Hofmann, David Ahn, Mahboo...
NLDB
2005
Springer
14 years 1 months ago
Combining Data-Driven Systems for Improving Named Entity Recognition
Abstract. The increasing flow of digital information requires the extraction, filtering and classification of pertinent information from large volumes of texts. An important pre...
Zornitsa Kozareva, Óscar Ferrández, ...
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 2 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
ICC
2007
IEEE
112views Communications» more  ICC 2007»
14 years 1 months ago
Algebraic Constructions of Space-Frequency Codes
— Recently an algebraic construction of (nt × Q) space-frequency (SF) codes over finite field Fq was proposed for use in MIMO-OFDM systems, where nt is the number of transmit ...
Mao-Ching Chiu, Hsiao-feng Lu
RTA
1991
Springer
13 years 11 months ago
Narrowing Directed by a Graph of Terms
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
Jacques Chabin, Pierre Réty