Sciweavers

PAMI
2002
86views more  PAMI 2002»
13 years 11 months ago
Recognizing Mathematical Expressions Using Tree Transformation
We describe a robust and efficient system for recognizing typeset and handwritten mathematical notation. From a list of symbols with bounding boxes the system analyzes an expressio...
Richard Zanibbi, Dorothea Blostein, James R. Cordy
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 11 months ago
Intermediate Performance of Rateless Codes
Abstract-- Fountain codes are designed so that all input symbols can be recovered from a slightly larger number of coded symbols, with high probability using an iterative decoder. ...
Sujay Sanghavi
FASE
2006
Springer
14 years 3 months ago
Regular Inference for State Machines with Parameters
Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to cons...
Therese Berg, Bengt Jonsson, Harald Raffelt