Sciweavers

1992 search results - page 188 / 399
» On the (limited) power of non-equivocation
Sort
View
FINTAL
2006
15 years 10 months ago
Regular Approximation of Link Grammar
We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. Th...
Filip Ginter, Sampo Pyysalo, Jorma Boberg, Tapio S...
AUSAI
2003
Springer
15 years 10 months ago
Token Identification Using HMM and PPM Models
Hidden markov models (HMMs) and prediction by partial matching models (PPM) have been successfully used in language processing tasks including learning-based token identification. ...
Yingying Wen, Ian H. Witten, Dianhui Wang
MFCS
2000
Springer
15 years 10 months ago
Bilinear Functions and Trees over the (max, +) Semiring
Abstract. We consider the iterates of bilinear functions over the semiring (max, +). Equivalently, our object of study can be viewed as recognizable tree series over the semiring (...
Sabrina Mantaci, Vincent D. Blondel, Jean Mairesse
ASAP
1997
IEEE
92views Hardware» more  ASAP 1997»
15 years 10 months ago
Optimized software synthesis for synchronous dataflow
This paper reviews a set of techniques for compiling dataflow-based, graphical programs for embedded signal processing applications into efficient implementations on programmable ...
Shuvra S. Bhattacharyya, Praveen K. Murthy, Edward...
SIGGRAPH
1991
ACM
15 years 10 months ago
Artificial evolution for computer graphics
CT This paper describes how evolutionary techniques of variation and selection can be used to create complex simulated structures, textures, and motions for use in computer graphic...
Karl Sims