Results 1 - 10
of
2,119
Computing all the best swap edges distributively
- PROC. 8-TH INT. CONFERENCE ON PRINCIPLES OF DISTRIBUTED SYSTEMS (OPODIS’04), LNCS 3544
, 2004
"... Recently great attention has been given to point-of-failure swap rerouting, an efficient technique for routing in presence of transient failures. According to this technique, a message follows the normal routing table information unless the next hop has failed; in this case, it is redirected towards ..."
Abstract
-
Cited by 9 (4 self)
- Add to MetaCart
this information; none of them can unfortunately be efficiently implemented in a distributed environment. In this paper we present protocols, based on a new strategy, that allow the efficient computation of all the optimal swap edges under several optimization criteria.
Ant Colony System: A cooperative learning approach to the traveling salesman problem
- IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
, 1997
"... This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to TSP’s. Ants cooperate using an indirect form of communication mediated by a pher ..."
Abstract
-
Cited by 1029 (53 self)
- Add to MetaCart
pheromone they deposit on the edges of the TSP graph while building solutions. We study the ACS by running experiments to understand its operation. The results show that the ACS outperforms other nature-inspired algorithms such as simulated annealing and evolutionary computation, and we conclude comparing
Graphical models, exponential families, and variational inference
, 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract
-
Cited by 819 (28 self)
- Add to MetaCart
of probability distributions — are best studied in the general setting. Working with exponential family representations, and exploiting the conjugate duality between the cumulant function and the entropy for exponential families, we develop general variational representations of the problems of computing
Random Key Predistribution Schemes for Sensor Networks”,
- IEEE Symposium on Security and Privacy,
, 2003
"... Abstract Efficient key distribution is the basis for providing secure communication, a necessary requirement for many emerging sensor network applications. Many applications require authentic and secret communication among neighboring sensor nodes. However, establishing keys for secure communicatio ..."
Abstract
-
Cited by 832 (12 self)
- Add to MetaCart
keys for all pairs of nodes is not viable due to the large number of sensors and the limited memory of sensor nodes. A new key distribution approach was proposed by Eschenauer and Gligor [11] to achieve secrecy for node-to-node communication: sensor nodes receive a random subset of keys from a key pool
Computing All Best Swaps for . . .
, 2010
"... In a densely connected communication network, represented by a graph G with non-negative edge weights, it is often advantageous to route all communication on a sparse spanning subnetwork, typically a spanning tree of G. We consider a tree spanner T of G which guarantees that for any two nodes, their ..."
Abstract
- Add to MetaCart
edge in the spanner T, a best swap edge that minimizes the stretch of the new tree. We show how all these best swap edges
The Determinants of Credit Spread Changes.
- Journal of Finance
, 2001
"... ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression are ..."
Abstract
-
Cited by 422 (2 self)
- Add to MetaCart
spreads, with most of the remainder attributable to a single systematic factor. Similarly, Duffie and Singleton (1999) find that both credit-risk and liquidity factors are necessary to explain innovations in U.S. swap rates. However, when analyzing the residuals they are unable to find explanatory factors
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
- IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING
, 2007
"... Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disconnects the network. Most often, the link is restored rapidly. A good policy to deal with this sort of transient link fail ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
swapping. We propose a distributed algorithm that efficiently computes all of these swap links, and we explain how to route messages across swap edges with a compact routing scheme. Finally, we consider the computation of swap edges in an arbitrary spanning tree, where swap edges are chosen to minimize
A Distributed Algorithm for All Best Swap Edges of a Minimum Diameter Spanning Tree
"... Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disconnects the network. Most often, the link is restored rapidly. A good policy to deal with this sort of transient link fail ..."
Abstract
- Add to MetaCart
swapping. We propose a distributed algorithm that efficiently computes all of these swap links, and we explain how to route messages across swap edges with a compact routing scheme.
Multiple Kernels for Object Detection
"... Our objective is to obtain a state-of-the art object category detector by employing a state-of-the-art image classifier to search for the object in all possible image subwindows. We use multiple kernel learning of Varma and Ray (ICCV 2007) to learn an optimal combination of exponential χ 2 kernels, ..."
Abstract
-
Cited by 275 (10 self)
- Add to MetaCart
, each of which captures a different feature channel. Our features include the distribution of edges, dense and sparse visual words, and feature descriptors at different levels of spatial organization. Such a powerful classifier cannot be tested on all image sub-windows in a reasonable amount of time
Distributed Computation for Swapping a Failing
"... Abstract. We consider the problem of computing the best swap edges of a shortest-path tree Tr rooted in r. That is, given a single link failure: if the path is not affected by the failed link, then the message will be delivered through that path; otherwise, we want to guarantee that, when the messag ..."
Abstract
- Add to MetaCart
Abstract. We consider the problem of computing the best swap edges of a shortest-path tree Tr rooted in r. That is, given a single link failure: if the path is not affected by the failed link, then the message will be delivered through that path; otherwise, we want to guarantee that, when
Results 1 - 10
of
2,119