Results 1  10
of
214,147
RKleene: A HighPerformance DivideandConquer Algorithm for the AllPair Shortest Path for Densely Connected Networks
, 2007
"... We propose a novel divideandconquer algorithm for the solution of the allpair shortestpath problem for directed and dense graphs with no negative cycles. We propose RKleene, a compact and inplace recursive algorithm inspired by Kleene’s algorithm. RKleene delivers a better performance than p ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
We propose a novel divideandconquer algorithm for the solution of the allpair shortestpath problem for directed and dense graphs with no negative cycles. We propose RKleene, a compact and inplace recursive algorithm inspired by Kleene’s algorithm. RKleene delivers a better performance than
A DivideandConquer Algorithm for
"... Abstract. The problem of efficiently computing the betweenness centrality of nodes has been researched extensively. To date, the best known exact and centralized algorithm for this task is an algorithm proposed in 2001 by Brandes [7]. The contribution of our paper is Brandes++, an algorithm for ex ..."
Abstract
 Add to MetaCart
for exact efficient computation of betweenness centrality. The crux of our algorithm is that we create a sketch of the graph, that we call the skeleton, by replacing subgraphs with simpler graph structures. Depending on the underlying graph structure, using this skeleton and by keeping appropriate
Program Generation for the AllPairs Shortest Path Problem
, 2006
"... A recent trend in computing are domainspecific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fastchanging and increasingly complex computing platforms. Examples include ATLAS, SPIRAL, and the codelet generator in FFTW. Each of these generators prod ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
produces highly optimized source code directly from a problem specification. In this paper, we extend this list by a program generator for the wellknown FloydWarshall (FW) algorithm that solves the allpairs shortest path problem, which is important in a wide range of engineering applications
A DivideandConquer Algorithm for Betweenness Centrality ∗
, 2015
"... Given a set of target nodes S in a graph G we define the betweenness centrality of a node v with respect to S as the fraction of shortest paths among nodes in S that contain v. For this setting we describe Brandes++, a divideandconquer algorithm that can efficiently compute the exact values of bet ..."
Abstract
 Add to MetaCart
Given a set of target nodes S in a graph G we define the betweenness centrality of a node v with respect to S as the fraction of shortest paths among nodes in S that contain v. For this setting we describe Brandes++, a divideandconquer algorithm that can efficiently compute the exact values
Probabilistic Routing in Intermittently Connected Networks
 SIGMOBILE Mobile Computing and Communication Review
, 2004
"... In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There does ..."
Abstract

Cited by 633 (6 self)
 Add to MetaCart
In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts
Practical Parallel DivideandConquer Algorithms
, 1997
"... Nested data parallelism has been shown to be an important feature of parallel languages, allowing the concise expression of algorithms that operate on irregular data structures such as graphs and sparse matrices. However, previous nested dataparallel languages have relied on a vector PRAM impleme ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
implementation layer that cannot be efficiently mapped to MPPs with high interprocessor latency. This thesis shows that by restricting the problem set to that of dataparallel divideandconquer algorithms I can maintain the expressibility of full nested dataparallel languages while achieving good
The DivideandConquer Manifesto
 Proceedings of the Eleventh International Conference on Algorithmic Learning Theory
, 2000
"... . Existing machine learning theory and algorithms have focused on learning an unknown function from training examples, where the unknown function maps from a feature vector to one of a small number of classes. Emerging applications in science and industry require learning much more complex funct ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
applications. These systems all employ some form of divideandconquer, where the inputs and outputs are divided into smaller pieces (e.g., "windows"), classified, and then the results are merged to produce an overall solution. This paper defines the problem of divideandconquer learning
Cut Problems And Their Application To DivideAndConquer
, 1996
"... INTRODUCTION 5.1 One of the most important paradigms in the design and analysis of algorithms is the notion of a divideandconquer algorithm. Every undergraduate course on algorithms teaches this method as one of its staples: to solve a problem quickly, one carefully splits the problem into two s ..."
Abstract

Cited by 84 (0 self)
 Add to MetaCart
INTRODUCTION 5.1 One of the most important paradigms in the design and analysis of algorithms is the notion of a divideandconquer algorithm. Every undergraduate course on algorithms teaches this method as one of its staples: to solve a problem quickly, one carefully splits the problem into two
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
, 1997
"... We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms. The protocol's reaction is structured as a temporallyordered sequence of diffusing computations; each computat ..."
Abstract

Cited by 1095 (6 self)
 Add to MetaCart
computation consisting of a sequence of directed l i nk reversals. The protocol is highly adaptive, efficient and scalable; being bestsuited for use in large, dense, mobile networks. In these networks, the protocol's reaction to link failures typically involves only a localized "single pass
Results 1  10
of
214,147