Sciweavers

146 search results - page 5 / 30
» Independence Assumptions Considered Harmful
Sort
View
ISAAC
2009
Springer
83views Algorithms» more  ISAAC 2009»
14 years 1 months ago
Deletion without Rebalancing in Multiway Search Trees
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...
Siddhartha Sen, Robert Endre Tarjan
ISIPTA
2003
IEEE
14 years 20 days ago
Combining Belief Functions Issued from Dependent Sources
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ļ¬...
Marco E. G. V. Cattaneo
CORR
2008
Springer
136views Education» more  CORR 2008»
13 years 7 months ago
Data Fusion Trees for Detection: Does Architecture Matter?
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...
Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win
ECML
2006
Springer
13 years 11 months ago
Batch Classification with Applications in Computer Aided Diagnosis
Abstract. Most classification methods assume that the samples are drawn independently and identically from an unknown data generating distribution, yet this assumption is violated ...
Volkan Vural, Glenn Fung, Balaji Krishnapuram, Jen...
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
14 years 27 days ago
Network Game with Attacker and Protector Entities
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...