Sciweavers

3396 search results - page 217 / 680
» Tree representations of graphs
Sort
View
EACL
1993
ACL Anthology
13 years 10 months ago
Towards efficient parsing with proof-nets
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
Alain Lecomte
ECSQARU
2005
Springer
14 years 2 months ago
Probabilistic Graphical Models for the Diagnosis of Analog Electrical Circuits
We describe an algorithm to build a graphical model—more precisely: a join tree representation of a Markov network—for a steady state analog electrical circuit. This model can ...
Christian Borgelt, Rudolf Kruse
AIMSA
2006
Springer
14 years 1 months ago
A Proposal for Annotation, Semantic Similarity and Classification of Textual Documents
Abstract. In this paper, we present an approach for classifying documents based on the notion of a semantic similarity and the effective representation of the content of the docume...
Emmanuel Nauer, Amedeo Napoli
AISC
2006
Springer
14 years 1 months ago
A Search Engine for Mathematical Formulae
We present a search engine for mathematical formulae. The MathWebSearch system harvests the web for content representations (currently MathML and OpenMath) of formulae and indexes ...
Michael Kohlhase, Ioan Sucan
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
13 years 10 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...