1274 search results - page 106 / 255 » Graph lambda theories |
JUCS
2007
13 years 9 months ago
2007
: For modeling real-life situations where not only the intensity of the relation existing between elements but also its polarity is important, we have proposed (see [Marcus and Tat...
JACM
2000
13 years 8 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
ER
2004
Springer
14 years 2 months ago
2004
Springer
Our goal is to model the way people induce knowledge from rare and sparse data. This paper describes a theoretical framework for inducing knowledge from these incomplete data descr...
ENTCS
2002
13 years 8 months ago
2002
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...