Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...
Dempsterās rule for combining two belief functions assumes the independence of the sources of information. If this assumption is questionable, I suggest to use the least speciļ¬...
We consider the problem of decentralized detection in a network consisting of a large number of nodes arranged as a tree of bounded height, under the assumption of conditionally in...
Abstract. Most classification methods assume that the samples are drawn independently and identically from an unknown data generating distribution, yet this assumption is violated ...
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...