Results 1  10
of
446
The geometry of graphs and some of its algorithmic applications
 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 graphtheoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations that r ..."
Abstract

Cited by 543 (20 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 graphtheoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations that respect the metric of the (possibly weighted) graph. Given a graph G we map its vertices to a normed space in an attempt to (i) Keep down the dimension of the host space and (ii) Guarantee a small distortion, i.e., make sure that distances between vertices in G closely match the distances between their geometric images. In this paper we develop efficient algorithms for embedding graphs lowdimensionally with a small distortion. Further algorithmic applications include: 0 A simple, unified approach to a number of problems on multicommodity flows, including the LeightonRae Theorem [29] and some of its extensions. 0 For graphs embeddable in lowdimensional spaces with a small distortion, we can find lowdiameter decompositions (in the sense of [4] and [34]). The parameters of the decomposition depend only on the dimension and the distortion and not on the size of the graph. 0 In graphs embedded this way, small balanced separators can be found efficiently. Faithful lowdimensional representations of statistical data allow for meaningful and efficient clustering, which is one of the most basic tasks in patternrecognition. For the (mostly heuristic) methods used
Coding for errors and erasures in random network coding
, 2007
"... The problem of errorcontrol in random network coding is considered. A “noncoherent” or “channel oblivious ” model is assumed where neither transmitter nor receiver is assumed to have knowledge of the channel transfer characteristic. Motivated by the property that random network coding is vectorspa ..."
Abstract

Cited by 258 (14 self)
 Add to MetaCart
The problem of errorcontrol in random network coding is considered. A “noncoherent” or “channel oblivious ” model is assumed where neither transmitter nor receiver is assumed to have knowledge of the channel transfer characteristic. Motivated by the property that random network coding is vectorspace preserving, information transmission is modelled as the injection into the network of a basis for a vector space V and the collection by the receiver of a basis for a vector space U. We introduce a metric on the space of all subspaces of a fixed vector space, and show that a minimum distance decoder for this metric achieves correct decoding if the dimension of the space V ∩ U is large enough. If the dimension of each codeword is restricted to a fixed integer, the code forms a subset of a finitefield Grassmannian. Spherepacking and spherecovering bounds as well as generalization of the Singleton bound are provided for such codes. Finally, a ReedSolomonlike code construction, related to Gabidulin’s construction of maximum rankdistance codes, is provided.
Deterministic and Stochastic Models for Coalescence (Aggregation, Coagulation): a Review of the MeanField Theory for Probabilists
 Bernoulli
, 1997
"... Consider N particles, which merge into clusters according to the rule: a cluster of size x and a cluster of size y merge at (stochastic) rate K(x; y)=N , where K is a specified rate kernel. This MarcusLushnikov model of stochastic coalescence, and the underlying deterministic approximation given by ..."
Abstract

Cited by 227 (13 self)
 Add to MetaCart
(Show Context)
Consider N particles, which merge into clusters according to the rule: a cluster of size x and a cluster of size y merge at (stochastic) rate K(x; y)=N , where K is a specified rate kernel. This MarcusLushnikov model of stochastic coalescence, and the underlying deterministic approximation given by the Smoluchowski coagulation equations, have an extensive scientific literature. Some mathematical literature (Kingman's coalescent in population genetics; component sizes in random graphs) implicitly studies the special cases K(x; y) = 1 and K(x; y) = xy. We attempt a wideranging survey. General kernels are only now starting to be studied rigorously, so many interesting open problems appear. Keywords. branching process, coalescence, continuum tree, densitydependent Markov process, gelation, random graph, random tree, Smoluchowski coagulation equation Research supported by N.S.F. Grant DMS9622859 1 Introduction Models, implicitly or explicitly stochastic, of coalescence (= coagulati...
A New Class of Upper Bounds on the Log Partition Function
 In Uncertainty in Artificial Intelligence
, 2002
"... Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis [11, 5, 4]. We introduce a new class of upper bounds on the log partition function, based on convex combinations of distribution ..."
Abstract

Cited by 220 (33 self)
 Add to MetaCart
Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis [11, 5, 4]. We introduce a new class of upper bounds on the log partition function, based on convex combinations of distributions in the exponential domain, that is applicable to an arbitrary undirected graphical model. In the special case of convex combinations of treestructured distributions, we obtain a family of variational problems, similar to the Bethe free energy, but distinguished by the following desirable properties: (i) they are convex, and have a unique global minimum; and (ii) the global minimum gives an upper bound on the log partition function. The global minimum is defined by stationary conditions very similar to those defining xed points of belief propagation (BP) or treebased reparameterization [see 13, 14]. As with BP fixed points, the elements of the minimizing argument can be used as approximations to the marginals of the original model. The analysis described here can be extended to structures of higher treewidth (e.g., hypertrees), thereby making connections with more advanced approximations (e.g., Kikuchi and variants [15, 10]).
Visual Cryptography for General Access Structures
, 1996
"... A visual cryptography scheme for a set P of n participants is a method to encode a secret image SI into n shadow images called shares, where each participant in P receives one share. Certain qualified subsets of participants can "visually" recover the secret image, but other, forbidden, se ..."
Abstract

Cited by 103 (9 self)
 Add to MetaCart
A visual cryptography scheme for a set P of n participants is a method to encode a secret image SI into n shadow images called shares, where each participant in P receives one share. Certain qualified subsets of participants can "visually" recover the secret image, but other, forbidden, sets of participants have no information (in an informationtheoretic sense) on SI . A "visual" recovery for a set X ` P consists of xeroxing the shares given to the participants in X onto transparencies, and then stacking them. The participants in a qualified set X will be able to see the secret image without any knowledge of Cryptography and without performing any cryptographic computation. In this paper we propose two techniques to construct visual cryptography schemes for general access structures. We analyze the structure of visual cryptography schemes and we prove bounds on the size of the shares distributed to the participants in the scheme. We provide a novel technique to realize k out of n thre...
Probabilistic and Statistical Properties of Words: An Overview
 Journal of Computational Biology
, 2000
"... In the following, an overview is given on statistical and probabilistic properties of words, as occurring in the analysis of biological sequences. Counts of occurrence, counts of clumps, and renewal counts are distinguished, and exact distributions as well as normal approximations, Poisson process a ..."
Abstract

Cited by 103 (4 self)
 Add to MetaCart
In the following, an overview is given on statistical and probabilistic properties of words, as occurring in the analysis of biological sequences. Counts of occurrence, counts of clumps, and renewal counts are distinguished, and exact distributions as well as normal approximations, Poisson process approximations, and compound Poisson approximations are derived. Here, a sequence is modelled as a stationary ergodic Markov chain; a test for determining the appropriate order of the Markov chain is described. The convergence results take the error made by estimating the Markovian transition probabilities into account. The main tools involved are moment generating functions, martingales, Stein’s method, and the ChenStein method. Similar results are given for occurrences of multiple patterns, and, as an example, the problem of unique recoverability of a sequence from SBH chip data is discussed. Special emphasis lies on disentangling the complicated dependence structure between word occurrences, due to selfoverlap as well as due to overlap between words. The results can be used to derive approximate, and conservative, con � dence intervals for tests. Key words: word counts, renewal counts, Markov model, exact distribution, normal approximation, Poisson process approximation, compound Poisson approximation, occurrences of multiple words, sequencing by hybridization, martingales, moment generating functions, Stein’s method, ChenStein method. 1.
Discrete Mobile Centers
 Discrete and Computational Geometry
, 2001
"... We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a variable subset of the nodes as cluster centers. This subset has the property that (1) balls of the given radius centered a ..."
Abstract

Cited by 96 (14 self)
 Add to MetaCart
(Show Context)
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a variable subset of the nodes as cluster centers. This subset has the property that (1) balls of the given radius centered at the chosen nodes cover all the others and (2) the number of centers selected is a constantfactor approximation of the minimum possible. As the nodes move, an eventbased kinetic data structure updates the clustering as necessary. This kinetic data structure is shown to be responsive, efficient, local, and compact. The produced cover is also smooth, in the sense that wholesale cluster rearrangements are avoided. The algorithm can be implemented without exact knowledge of the node positions, if each node is able to sense its distance to other nodes up to the cluster radius. Such a kinetic clustering can be used in numerous applications where mobile devices must be interconnected into an adhoc network to collaboratively perform some tasks. 1
Test Wrapper and Test Access Mechanism Cooptimization for SystemonChip
 JETTA
, 2002
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract

Cited by 85 (25 self)
 Add to MetaCart
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
On the solution of linear differential equations in Lie groups
, 1997
"... The subject matter of this paper is the solution of the linear differential equation y = a#t#y, y#0# = y0 , where y0 2 G, a# # #:R !gand g is a Lie algebra of the Lie group G. By building upon an earlier work of Wilhelm Magnus [16], we represent the solution as an infinite series whose terms are ind ..."
Abstract

Cited by 80 (11 self)
 Add to MetaCart
The subject matter of this paper is the solution of the linear differential equation y = a#t#y, y#0# = y0 , where y0 2 G, a# # #:R !gand g is a Lie algebra of the Lie group G. By building upon an earlier work of Wilhelm Magnus [16], we represent the solution as an infinite series whose terms are indexed by binary trees. This relationship between the infinite series and binary trees leads both to a convergence proof and to a constructive computational algorithm. This numerical method requires the evaluation of a large number of multivariate integrals but this can be accomplished in a tractable manner by using quadrature schemes in a novel manner and by exploiting the structure of the Lie algebra.