Sciweavers

2024 search results - page 35 / 405
» The Meaning of Ordered SOS
Sort
View
ICASSP
2011
IEEE
12 years 11 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...
QUESTA
2006
87views more  QUESTA 2006»
13 years 7 months ago
Some universal limits for nonhomogeneous birth and death processes
In this paper we consider nonhomogeneous birth and death processes (BDP) with periodic rates. Two important parameters are studied, which are helpful to describe a nonhomogeneous B...
Alexander I. Zeifman, S. Leorato, E. Orsingher, Ya...
RTA
1993
Springer
13 years 11 months ago
Total Termination of Term Rewriting
Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally ...
Maria C. F. Ferreira, Hans Zantema
KDD
2003
ACM
99views Data Mining» more  KDD 2003»
14 years 8 months ago
Fragments of order
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
Aristides Gionis, Teija Kujala, Heikki Mannila
DATE
2010
IEEE
157views Hardware» more  DATE 2010»
14 years 20 days ago
RMOT: Recursion in model order for task execution time estimation in a software pipeline
Abstract—This paper addresses the problem of execution time estimation for tasks in a software pipeline independent of the application structure or the underlying architecture. A...
Nabeel Iqbal, M. A. Siddique, Jörg Henkel