1022 search results - page 174 / 205 » Relators and Metric Bisimulations |
188
click to vote
DAM
1999
15 years 5 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
192
click to vote
PAMI
1998
15 years 5 months ago
1998
—We present ordinal measures of association for image correspondence in the context of stereo. Linear correspondence measures like correlation and the sum of squared difference b...
165
click to vote
PE
2002
Springer
15 years 5 months ago
2002
Springer
Quality of service (QoS) in delivery of continuous media (CM) over the Internet is still relatively poor and inconsistent. Although many such applications can tolerate some degree...
187
click to vote
TAPOS
1998
15 years 5 months ago
1998
Building and maintaining the class hierarchy has been recognized as an important but one of the most difficult activities of object-oriented design. Concept (or Galois) lattices a...
191
click to vote
ENTCS
2007
15 years 5 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...