1402 search results - page 93 / 281 » Searching Cycle-Disjoint Graphs |
AAAI
1990
14 years 11 months ago
1990
The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 19891 provides an efficient framework for resolving general queries on a belief network. It applies the conc...
CPC
2002
14 years 9 months ago
2002
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
HEURISTICS
2002
14 years 9 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
HT
1997
ACM
15 years 2 months ago
1997
ACM
A large hypertext net with node-to-node links can be interesting as a system of unities of meaning formed by node clusters, such that nodes in each of them are orderable into a co...