2713 search results - page 61 / 543 » Parameterized Tree Systems |
RTA
2005
Springer
14 years 3 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
PRDC
2008
IEEE
14 years 4 months ago
2008
IEEE
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the appli...
ICASSP
2009
IEEE
13 years 7 months ago
2009
IEEE
We consider the problem of configuring classifier trees in distributed stream mining system. The configuration involves selecting appropriate false-alarm detection tradeoffs for e...
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
Automatic speech recognition (ASR) systems have been developed only for a very limited number of the estimated 7,000 languages in the world. In order to avoid the evolvement of a ...