Sciweavers

39 search results - page 7 / 8
» cal 2007
Sort
View
IJCAI
1993
14 years 11 months ago
On the Polynomial Transparency of Resolution
In this paper a framework is developed for measuring the complexities of deductions in an ab­ stract and computationally perspicuous man­ ner. As a notion of central importance ...
Reinhold Letz
109
Voted
ACS
2002
14 years 10 months ago
Categorical Abstract Algebraic Logic: Algebraizable Institutions
cal Abstract Algebraic Logic: Algebraizable Institutions To Don Pigozzi this work is dedicated GEORGE VOUTSADAKIS Department of Mathematics, Iowa State University, Ames, IA 50011 U...
George Voutsadakis
94
Voted
ICDT
2007
ACM
105views Database» more  ICDT 2007»
15 years 4 months ago
Optimization of Query Plans in the presence of Access Limitations
We consider the problem of querying data sources that have limited capabilities and can thus only be accessed by complying with certain binding patterns for their attributes. This ...
Andrea Calì, Diego Calvanese, Davide Martin...
ICASSP
2011
IEEE
14 years 1 months ago
A dynamic approach to the selection of high order n-grams in phonotactic language recognition
Due to computational bounds, most SVM-based phonotactic language recognition systems consider only low-order n-grams (up to n = 3), thus limiting the potential performance of this...
Mikel Peñagarikano, Amparo Varona, Luis Jav...
76
Voted
ICASSP
2010
IEEE
14 years 10 months ago
Using cross-decoder phone coocurrences in phonotactic language recognition
Phonotactic language recognizers are based on the ability of phone decoders to produce phone sequences containing acoustic, phonetic and phonological information, which is partial...
Mikel Peñagarikano, Amparo Varona, Luis Jav...