427 search results - page 14 / 86 » Computing the Local Consensus of Trees |
101
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble...
104
click to vote
ICDE
2012
IEEE
12 years 12 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
ISCC
2005
IEEE
15 years 3 months ago
2005
IEEE
— As broadcasting is widely used for miscellaneous maintenance operations in wireless ad hoc networks, where energy is a scarce resource, an efficient broadcasting protocol is o...
EJC
2010
14 years 9 months ago
2010
We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to th...
COLING
1996
14 years 10 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...