15416 search results - page 366 / 3084 » Embeddings of Computable Structures |
253
click to vote
CCCG
2009
15 years 8 months ago
2009
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
187
Voted
ICIP
2001
IEEE
16 years 9 months ago
2001
IEEE
An area based counterpart of the binary structural opening spectra is developed. It is shown that these area opening and closing spectra can be computed using an adaptation of Tar...
199
click to vote
ACL
2007
15 years 9 months ago
2007
This paper describes a new method for computing lexical chains. These are sequences of semantically related words that reflect a text’s cohesive structure. In contrast to previo...
212
click to vote
FOSSACS
2011
Springer
14 years 11 months ago
2011
Springer
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
197
Voted
COLING
2010
15 years 2 months ago
2010
A great deal of information on the Web is represented in both textual and structured form. The structured form is machinereadable and can be used to augment the textual data. We c...