Sciweavers

250 search results - page 23 / 50
» Fixed Argument Pairings
Sort
View
FOSSACS
2004
Springer
14 years 3 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
HICSS
2002
IEEE
80views Biometrics» more  HICSS 2002»
14 years 2 months ago
Collaboration between Writer and Reviewer through Change Representation Tools
Change representation concerns how changes of text are presented in writing tools. Change representation in collaborative writing can play an important role for the collaborators&...
Hee-Cheol (Ezra) Kim, Kerstin Severinson Eklundh
EACL
1993
ACL Anthology
13 years 11 months ago
Inheriting Verb Alternations
The paper shows how the verbal lexicon can be formalised in a way that captures and exploits generalisations about the alternation behaviour of verb classes. An alternation is a p...
Adam Kilgarriff
INFORMATICALT
2010
151views more  INFORMATICALT 2010»
13 years 8 months ago
The Use of Group Delay Features of Linear Prediction Model for Speaker Recognition
Abstract. New text independent speaker identification method is presented. Phase spectrum of allpole linear prediction (LP) model is used to derive the speech features. The featur...
Algirdas Bastys, Andrej Kisel, Bernardas Salna
TLCA
2005
Springer
14 years 3 months ago
Recursive Functions with Higher Order Domains
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
Ana Bove, Venanzio Capretta