Sciweavers

3946 search results - page 201 / 790
» The computational complexity of choice sets
Sort
View
COLING
2002
15 years 6 months ago
Text Authoring, Knowledge Acquisition and Description Logics
We present a principled approach to the problem of connecting a controlled document authoring system with a knowledge base. We start by describingclosed-world authoring situations...
Marc Dymetman
PAA
2008
15 years 6 months ago
Motion synthesis through 1D affine matching
We present the study of a data-driven motion synthesis approach based on a 1D affine imagematching equation. We start by deriving the relevant properties of the exact matching oper...
Perfilino Eugênio Ferreira Jr., José ...
JSC
2010
107views more  JSC 2010»
15 years 5 months ago
Solving the conjugacy problem in Garside groups by cyclic sliding
1 We present a solution to the conjugacy decision problem and the conjugacy search problem2 in Garside groups, which is theoretically simpler than the usual one, with no loss of e...
Volker Gebhardt, Juan González-Meneses
ICASSP
2011
IEEE
14 years 10 months ago
An efficient variable step-size proportionate affine projection algorithm
Proportionate-type affine projection algorithms (PAPAs) are very attractive choices for echo cancellation. These algorithms combine the good features (convergence and tracking) o...
Constantin Paleologu, Jacob Benesty, Felix Albu, S...
CAIP
1999
Springer
145views Image Analysis» more  CAIP 1999»
15 years 11 months ago
Optimized Fast Algorithms for the Quaternionic Fourier Transform
Abstract. In this article, we deal with fast algorithms for the quaternionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hen...
Michael Felsberg, Gerald Sommer