Sciweavers

2079 search results - page 374 / 416
» Universality of random graphs
Sort
View
AHSWN
2008
92views more  AHSWN 2008»
15 years 5 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
CORR
2010
Springer
154views Education» more  CORR 2010»
15 years 5 months ago
Causal Markov condition for submodular information measures
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
Bastian Steudel, Dominik Janzing, Bernhard Sch&oum...
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 5 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez
ECRA
2010
145views more  ECRA 2010»
15 years 5 months ago
Inferring preference correlations from social networks
Identifying consumer preferences is a key challenge in customizing electronic commerce sites to individual users. The increasing availability of online social networks provides on...
Tad Hogg
EOR
2010
99views more  EOR 2010»
15 years 5 months ago
Min sum clustering with penalties
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
Refael Hassin, Einat Or