Filters








29 Hits in 4.0 sec

A new approach to the maximum-flow problem

Andrew V. Goldberg, Robert E. Tarjan
1988 Journal of the ACM  
All previously known efftcient maximum-flow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortest-length augmenting paths  ...  The algorithm also admits efticient distributed and parallel implementations. A parallel implementation running in O(n'log n) time using n processors and O(m) space is obtained.  ...  To improve the efftciency further, Dinic [4] proposed a method to find all shortest augmenting paths in one phase. Algorithms 2-l 1 use Dinic's method.  ... 
doi:10.1145/48014.61051 fatcat:rensxb26fzeidclqkou3fujkym

A new approach to the maximum flow problem

A V Goldberg, R E Tarjan
1986 Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86  
All previously known efftcient maximum-flow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortest-length augmenting paths  ...  The algorithm also admits efticient distributed and parallel implementations. A parallel implementation running in O(n'log n) time using n processors and O(m) space is obtained.  ...  To improve the efftciency further, Dinic [4] proposed a method to find all shortest augmenting paths in one phase. Algorithms 2-l 1 use Dinic's method.  ... 
doi:10.1145/12130.12144 dblp:conf/stoc/GoldbergT86 fatcat:guxzu74oyjg5zbppfggk24fhx4

Block-cyclic matrix triangulation on the Cartesian product of star graphs

A.-E. Al-Ayyoub, K. Day
1998 Computers and Mathematics with Applications  
The star graph has drawn a lot of attention recently as an attractive alternative to hypercube.  ...  The proposed techniques for matrix decomposition and mapping are of general use and can be applied to design other matrixbased algorithms on the Cartesian product of star graphs.  ...  An optimal one-to-all broadcasting algorithm for the hyperstar is given in Figure 2 . This algorithm broadcasts a message on a spanning tree rooted at the source node.  ... 
doi:10.1016/s0898-1221(98)00154-0 fatcat:zka3mjl3gzeqddi2wbdekudpre

Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation

To-Yat Cheung
1983 IEEE Transactions on Software Engineering  
He is currently an Assistant Professor of Computer Science at Stanford University.  ...  Hi book Database Design (McGraw-Hill, 1983, 2nd edition) is widely used as a text book, and is now also available in a German translation.  ...  We first present two distributed algorithms together with their computational complexity for graph traversal, based on the depth-first search and breadth-first search techniques.  ... 
doi:10.1109/tse.1983.234958 fatcat:wqykezpm5zfkvmxgaiwstne7wy

Data collection and event detection in the deep sea with delay minimization

Huanyang Zheng, Jie Wu
2015 2015 12th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)  
We also study the AUV trajectory planning using an extended Euler circuit, where the search space is a set of segments (e.g., oil pipes) in the deep sea.  ...  Finally, experiments in both the synthetic and real traces validate the efficiency and effectiveness of the proposed algorithms.  ...  We then pair odd vertices using minimum weight perfect matching [27] aiming to reduce added costs to paired odd vertices, where the cost of a pair (u, v) is the shortest path cost of u and v in G.  ... 
doi:10.1109/sahcn.2015.7338335 dblp:conf/secon/ZhengW15 fatcat:ro4vpsgoyzhubaalsyth22unji

Router group monitoring: making traffic trajectory error detection more efficient

Bo Zhang, Guohui Wang, Angela Zhu, T.S. Eugene Ng
2010 IEEE Transactions on Network and Service Management  
Several different traffic monitoring algorithms such as Trajectory Sampling, PSAMP, and Fatih can be used for traffic trajectory error detection.  ...  Based on this model, we propose an algorithm to select a set of router groups that can achieve complete error detection and low monitoring overhead.  ...  The interfaces will not be monitored if the corresponding link is not used or only used in an end-to-end path with length 2.  ... 
doi:10.1109/tnsm.2010.1009.i9p03322 fatcat:mrh7r7gmfbaarj2xcmj7kcgqte

Selection, Routing, and Sorting on the Star Graph

Sanguthevar Rajasekaran, David S.L. Wei
1997 Journal of Parallel and Distributed Computing  
We present an algorithm that performs a sequence of n prefix computations in O(n 2 ) time. This algorithm is used as a subroutine in our other algorithms.  ...  We present an algorithm that performs a sequence of n prefix computations in O(n2) time. This algorithm is used as a subroutine in our other algorithms.  ...  For example, in Sq, 4231 -1234 -2134 -4132 denotes a path of length 3. Definition 2. 6 The distance between two nodes u and v is the length of the shortest path between u and v.  ... 
doi:10.1006/jpdc.1996.1297 fatcat:okxp4knrnzctplmhxc3tmm6kaq

The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC [chapter]

Peter Gaži, Krzysztof Pietrzak, Stefano Tessaro
2015 Lecture Notes in Computer Science  
Still, our analysis crucially relies on the one for truncated CBC as an intermediate step of independent interest.  ...  method for SHA-3-based message authentication.  ...  Gaži and Pietrzak's work was partly funded by the European Research Council under an ERC Starting Grant (259668-PSPC).  ... 
doi:10.1007/978-3-662-47989-6_18 fatcat:kdhsqtpm2zfdbnwai76yl7a724

On the randomness complexity of efficient sampling

Bella Dubrov, Yuval Ishai
2006 Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06  
(A compression algorithm for f should efficiently compress an input x in a way that will preserve the information needed to compute f (x).)  ...  We consider the following question: Can every efficiently samplable distribution be efficiently sampled, up to a small statistical distance, using roughly as much randomness as the length of its output  ...  For each oracle gate we delete all the paths from it to the output. (By deleting a path we mean deleting all the gates and edges on the path.  ... 
doi:10.1145/1132516.1132615 dblp:conf/stoc/DubrovI06 fatcat:gyuiktcxkzb4xe4eeof7xi42lu

Timed Hazard Analysis of Self-healing Systems [chapter]

Claudia Priesterjahn, Dominik Steenken, Matthias Tichy
2013 Lecture Notes in Computer Science  
We illustrate our approach by an example case study from the RailCab project.  ...  Self-healing can be used to reduce hazards in embedded realtime systems which are applied in safety-critical environments.  ...  Instead, we consider all possible paths. From the zone graph we extract all paths that contain the message of the detection of the error or failure and the execution of the reconfiguration.  ... 
doi:10.1007/978-3-642-36249-1_5 fatcat:2g6zm4cvc5fqzfpdpsj6j4kkvu

A binary relation inference network for constrained optimization

Crystal J. Su
1992
The network transforms some optimization problems (shortest path, transitive closure, assignment, etc.) into network convergence problems and divides the work load evenly among all processors.  ...  These kind of algorithms usually have difficulty in distributing work load evenly among processors [69]. Many distributed parallel computing models have been proposed for various types of problems.  ...  The third class of algorithms, all-pair algorithms, find the shortest paths between all the node pairs at the same time.  ... 
doi:10.14288/1.0065233 fatcat:gqh5lsp7jzgvxawrezqnwd7t5q

Kinetic roughening phenomena, stochastic growth, directed polymers and all that. Aspects of multidisciplinary statistical mechanics

Timothy Halpin-Healy, Yi-Cheng Zhang
1995 Physics reports  
This very simple stochastic growth algorithm, trivially implemented on the computer, is iterated repeatedly giving rise to an Eden cluster that is compact, nonfractal in the bulk, but with intriguing surface  ...  After submission of this manuscript, we learned that Barabasi and Stanley [ BS94] have nearly completed an inspired, useful elementary book on fractal interface growth, while Maritan et al.  ...  We are indebted to many colleagues and friends who have shared with us their insights, enthusiasm, and offered us help. In particular,  ... 
doi:10.1016/0370-1573(94)00087-j fatcat:kwz2xwvx2zaxdbawslxuq5jij4

Adaptive equalization

S.U.H. Qureshi
1985 Proceedings of the IEEE  
An attempt is made throughout the paper to describe important principles and results in a heuristic manner, without formal proofs, using simple mathematical notation where possible.  ...  This tutorial paper gives an overview of the current state of the art in adaptive equalization.  ...  The complexity of the classical receiver, which grows exponentially with the message length, can be avoided by using the Viterbi algorithm.  ... 
doi:10.1109/proc.1985.13298 fatcat:csxa4sag4jes5poyujgwsiqj2e

International Journal of Mathematical Combinatorics, vol. 2/2016

Linfan Mao, Guohua Song
2018 Figshare  
journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 100-150 pages approx. per volume, which publishes original researchpapers and survey articles in all  ...  of G which is defined as the length of any shortest path in G connecting them.  ...  we require (n 2 ) algorithm.  ... 
doi:10.6084/m9.figshare.6198962.v1 fatcat:uqjbzgsmfzehbf4qredawufxje

On the Convergence of Shallow Neural Network Training with Randomly Masked Neurons [article]

Fangshuo Liao, Anastasios Kyrillidis
2021 arXiv   pre-print
error region – for an overparameterized single-hidden layer perceptron with ReLU activations for a regression task.  ...  subnetworks' neural tangent kernel, ii) the surrogate functions' gradient, and iii) how we sample and combine the surrogate functions, we prove linear convergence rate of the training error – within an  ...  We use P(·) to denote the probability of an event, and I{·} the indicator function. For distributions, we use N (µ, Σ) to denote the Gaussian distribution with mean µ and variance Σ.  ... 
arXiv:2112.02668v1 fatcat:lwkjagmebraszhyneu5kiblckm
« Previous Showing results 1 — 15 out of 29 results