5451 search results - page 158 / 1091 » On very high degrees |
174
click to vote
ICMCS
2005
IEEE
16 years 20 days ago
2005
IEEE
This paper presents an efficient method for the conversion between subband domain representations of different filter banks. It advantageously replaces the conventional cascade of...
174
Voted
CLEF
2005
Springer
16 years 18 days ago
2005
Springer
We developed algorithmic stemmers for Hungarian and used them for the ad-hoc monolingual task for CLEF 2005. Our goal was to determine what degree of stemming is the most effectiv...
179
click to vote
GIAE
2004
Springer
16 years 13 days ago
2004
Springer
For a first order autonomous ODE, we give a polynomial time algorithm to decide whether it has a polynomial general solution and to compute one if it exists. Experiments show that...
167
click to vote
ICCD
1993
IEEE
15 years 11 months ago
1993
IEEE
Symbolic representations of systems can achieve a high degree of compaction relative to more explicit forms. By casting an analysis task in terms of operations on a symbolic repre...
174
Voted
COOPIS
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper we present an implementation of a constraint solving module, CLP(Flex), for dealing with unification in an equality theory for terms with flexible arity function symb...