Sciweavers

564 search results - page 19 / 113
» Training Tree Transducers
Sort
View
ASIAN
2003
Springer
109views Algorithms» more  ASIAN 2003»
14 years 26 days ago
Deaccumulation - Improving Provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automated verification usually fails for functions with accumulating ar...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
ICASSP
2011
IEEE
12 years 11 months ago
A comparative analysis of dynamic network decoding
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
David Rybach, Ralf Schlüter, Hermann Ney
INFOCOM
2012
IEEE
11 years 10 months ago
Robust multi-source network tomography using selective probes
—Knowledge of a network’s topology and internal characteristics such as delay times or losses is crucial to maintain seamless operation of network services. Network tomography ...
Akshay Krishnamurthy, Aarti Singh
ICIP
1999
IEEE
13 years 12 months ago
On the Use of Context Tree for Binary Image Compression
We consider the use of a static context tree for binary image compression. The contexts are stored in the leaves of a variable-depth binary tree. The tree structure itself is full...
Pasi Fränti, Eugene I. Ageenko
ALGORITHMICA
2010
137views more  ALGORITHMICA 2010»
13 years 7 months ago
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...
Louis Ibarra