Results 1 - 10 of 17,181

Snap-stabilizing prefix tree for peer-to-peer systems

by Eddy Caron, Frédéric Desprez, Franck Petit, Cédric Tedeschi - Parallel Processing Letters , 2010
"... Abstract. Resource Discovery is a crucial issue in the deployment of computational grids over large scale peer-to-peer platforms. Because they efficiently allow range queries, Tries (a.k.a., Prefix Trees) appear to be among promising ways in the design of distributed data structures indexing resourc ..."
Abstract - Cited by 12 (3 self) - Add to MetaCart
resources. Self-stabilization is an efficient approach in the design of reliable solutions for dynamic systems. A snap-stabilizing algorithm guarantees that it always behaves according to its specification. In other words, a snap-stabilizing algorithm is also a self-stabilizing algorithm which stabilizes

Snap-stabilizing Prefix Tree for Peer-to-peer Systems

by École Normale, Supérieure Lyon, Eddy Caron, Frédéric Desprez, Franck Petit, Cédric Tedeschi, École Normale, Supérieure Lyon, Eddy Caron, Frédéric Desprez, Franck Petit, Cédric Tedeschi , 2007
"... Resource Discovery is a crucial issue in the deployment of computational grids over large scale peer-to-peer platforms. Because they efficiently allow range queries, Tries (a.k.a., Prefix Trees) appear to be among promising ways in the design of distributed data structures indexing resources. Self-s ..."
Abstract - Add to MetaCart
is an efficient approach in the design of reliable solutions for dynamic systems. A snap-stabilizing algorithm guarantees that it always behaves according to its specification. In other words, a snap-stabilizing algorithm is also a self-stabilizing algorithm which stabilizes in 0 steps. In this paper, we provide

On Probabilistic Snap-Stabilization

by Karine Altisen
"... Abstract. In this paper, we introduce probabilistic snap-stabilization. We re-lax the definition of deterministic snap-stabilization without compromising its safety guarantees. In an unsafe environment, a probabilistically snap-stabilizing algorithm satisfies its safety property immediately after th ..."
Abstract - Add to MetaCart
Abstract. In this paper, we introduce probabilistic snap-stabilization. We re-lax the definition of deterministic snap-stabilization without compromising its safety guarantees. In an unsafe environment, a probabilistically snap-stabilizing algorithm satisfies its safety property immediately after

Routing with Guaranteed Delivery in ad hoc Wireless Networks

by Prosenjit Bose , Pat Morin , Ivan Stojmenovic , Jorge Urrutia , 2001
"... We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than some fixed unit. We describe the first distributed algorithms for routing that do not require duplication of ..."
Abstract - Cited by 849 (80 self) - Add to MetaCart
of packets or memory at the nodes and yet guarantee that a packet is delivered to its destination. These algorithms can be extended to yield algorithms for broadcasting and geocasting that do not require packet duplication. A byproduct of our results is a simple distributed protocol for extracting a planar

Guaranteed minimumrank solutions of linear matrix equations via nuclear norm minimization,”

by Benjamin Recht , Maryam Fazel , Pablo A Parrilo - SIAM Review, , 2010
"... Abstract The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and col ..."
Abstract - Cited by 562 (20 self) - Add to MetaCart
, and collaborative filtering. Although specific instances can often be solved with specialized algorithms, the general affine rank minimization problem is NP-hard, because it contains vector cardinality minimization as a special case. In this paper, we show that if a certain restricted isometry property holds

State-Optimal Snap-Stabilizing PIF in Tree Networks (Extended Abstract)

by Alain Bui, Ajoy K. Datta, Franck Petit, Vincent Villain - In Proceedings of the Fourth Workshop on Self-Stabilizing Systems , 1999
"... ) Alain Bui, 1 Ajoy K. Datta, 2 Franck Petit, 1 Vincent Villain 1 1 LaRIA, Universit e de Picardie Jules Verne, France 2 Department of Computer Science, University of Nevada, Las Vegas Abstract In this paper, we introduce the notion of snapstabilization. A snap-stabilizing algorithm proto ..."
Abstract - Cited by 64 (29 self) - Add to MetaCart
) Alain Bui, 1 Ajoy K. Datta, 2 Franck Petit, 1 Vincent Villain 1 1 LaRIA, Universit e de Picardie Jules Verne, France 2 Department of Computer Science, University of Nevada, Las Vegas Abstract In this paper, we introduce the notion of snapstabilization. A snap-stabilizing algorithm

A greedy algorithm for aligning DNA sequences

by Zheng Zhang, Scott Schwartz, Lukas Wagner, Webb Miller - J. COMPUT. BIOL , 2000
"... For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic programming approaches and yet produce an alignment that is guaranteed to be theoretically optimal. We introduce a new greedy a ..."
Abstract - Cited by 585 (16 self) - Add to MetaCart
For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic programming approaches and yet produce an alignment that is guaranteed to be theoretically optimal. We introduce a new greedy

Fast probabilistic algorithms for verification of polynomial identities

by J. T. Schwartz - J. ACM , 1980
"... ABSTRACT The starthng success of the Rabm-Strassen-Solovay pnmahty algorithm, together with the intriguing foundattonal posstbthty that axtoms of randomness may constttute a useful fundamental source of mathemaucal truth independent of the standard axmmaUc structure of mathemaUcs, suggests a wgorous ..."
Abstract - Cited by 520 (1 self) - Add to MetaCart
wgorous search for probabdisuc algonthms In dlustratmn of this observaUon, vanous fast probabdlsttc algonthms, with probability of correctness guaranteed a prion, are presented for testing polynomial ldentmes and propemes of systems of polynomials. Ancdlary fast algorithms for calculating resultants

The geometry of graphs and some of its algorithmic applications

by Nathan Linial, Eran London, Yuri Rabinovich - COMBINATORICA , 1995
"... In this paper we explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graph-theoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations that res ..."
Abstract - Cited by 524 (19 self) - Add to MetaCart
In this paper we explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graph-theoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations

Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming

by M. X. Goemans, D.P. Williamson - Journal of the ACM , 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract - Cited by 1211 (13 self) - Add to MetaCart
the solution to a nonlinear programming relaxation. This relaxation can be interpreted both as a semidefinite program and as an eigenvalue minimization problem. The best previously known approximation algorithms for these problems had performance guarantees of ...
Results 1 - 10 of 17,181