Results 1  10
of
4,804
String theory and noncommutative geometry
 JHEP
, 1999
"... We extend earlier ideas about the appearance of noncommutative geometry in string theory with a nonzero Bfield. We identify a limit in which the entire string dynamics is described by a minimally coupled (supersymmetric) gauge theory on a noncommutative space, and discuss the corrections away from ..."
Abstract

Cited by 794 (8 self)
 Add to MetaCart
counterpart. We obtain a new perspective on noncommutative gauge theory on a torus, its Tduality, and Morita equivalence. We also discuss the D0/D4 system, the relation to Mtheory in DLCQ, and a possible noncommutative version of the sixdimensional (2, 0) theory. 8/99
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
limit performance of "Turbo Codes" codes whose decoding algorithm is equivalent to loopy belief propagation in a chainstructured Bayesian network. In this paper we ask: is there something spe cial about the errorcorrecting code context, or does loopy propagation work as an ap proximate inference scheme
Efficient exact stochastic simulation of chemical systems with many species and many channels
 J. Phys. Chem. A
, 2000
"... There are two fundamental ways to view coupled systems of chemical equations: as continuous, represented by differential equations whose variables are concentrations, or as discrete, represented by stochastic processes whose variables are numbers of molecules. Although the former is by far more comm ..."
Abstract

Cited by 427 (5 self)
 Add to MetaCart
simulation methods to simulate trajectories of discrete, stochastic systems, (methods that are rigorously equivalent to the Master Equation approach) but these do not scale well to systems with many reaction pathways. This paper presents the Next Reaction Method, an exact algorithm to simulate coupled
Laplaceisospectral hyperbolic 2orbifolds are representationequivalent (Version 1),
, 2011
"... Abstract Let M be a compact hyperbolic 2orbifold (not necessarily connected). We show that the spectrum of the Laplacian on functions on M determines the following: the volume; the total length of the mirror boundary; the number (properly counted) of conepoints of each order; and the number (prope ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(properly counted) of primitive closed geodesics of each length and orientability class. This means that Laplaceisospectral hyperbolic 2orbifolds are representationequivalent, and hence strongly isospectral. Statement Let M be a compact hyperbolic 2orbifold (not necessarily connected). Denote
An equivalent version of the CaccettaHäggkvist conjecture in an online load balancing problem
 In Proceedings of the 33rd Workshop on Graphs (WG), LNCS
, 2007
"... Abstract. We study the competitive ratio of certain online algorithms for a wellstudied class of load balancing problems. These algorithms are obtained and analyzed according to a method by Crescenzi et al (2004). We show that an exact analysis of their competitive ratio on certain “uniform ” insta ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We study the competitive ratio of certain online algorithms for a wellstudied class of load balancing problems. These algorithms are obtained and analyzed according to a method by Crescenzi et al (2004). We show that an exact analysis of their competitive ratio on certain “uniform ” instances would resolve a fundamental conjecture by Caccetta and Häggkvist (1978). The conjecture is that any digraph on n nodes and minimum outdegree d must contain a directed cycle involving at most ⌈n/d ⌉ nodes. Our results are the first relating this conjecture to the competitive analysis of certain algorithms, thus suggesting a new approach to the conjecture itself. We also prove that, on “uniform ” instances, the analysis by Crescenzi et al (2004) gives only trivial upper bounds, unless we find a counterexample to the conjecture. This is in contrast with other (notable) examples where the same analysis yields optimal (nontrivial) bounds. Key words: CaccettaHäggkvist conjecture, online load balancing, competitive analysis 1
The Linear TimeBranching Time Spectrum II  The semantics of sequential systems with silent moves
, 1993
"... ion Rule (KFAR) (Baeten, Bergstra & Klop [3]), expresses a global fairness assumption. It says that when possible a system will escape from any cycle of internal actions. Some form of KFAR is crucial for many protocal verifications with unreliable channels, and for that reason preorders and equi ..."
Abstract

Cited by 375 (21 self)
 Add to MetaCart
and equivalences that satisfy KFAR are of special interest. Must preorders and divergence sensitive ones cannot satisfy KFAR. In Bergstra, Klop & Olderog [7] it is shown that the combination of KFAR with failure semantics is inconsistent, but they formulate a weaker version of KFAR that is satisfied
Applicable Analysis and Discrete Mathematics INFINITELY MANY EQUIVALENT VERSIONS OF THE GRACEFUL TREE CONJECTURE
, 2015
"... A graceful labeling of a graph with q edges is a labeling of its vertices using the integers in [0, q], such that no two vertices are assigned the same label and each edge is uniquely identified by the absolute difference between the labels of its endpoints. The well known Graceful Tree Conjecture ..."
Abstract
 Add to MetaCart
result by showing that there exist infinitely many equivalent versions of the GTC. Moreover we verify these infinitely many equivalent conjectures of GTC for trees of diameter at most 7. Among others we are also able to identify new graceful trees and in particular generalize the ∆construction
An equivalence between sparse approximation and Support Vector Machines
 A.I. Memo 1606, MIT Arti cial Intelligence Laboratory
, 1997
"... This publication can be retrieved by anonymous ftp to publications.ai.mit.edu. The pathname for this publication is: aipublications/15001999/AIM1606.ps.Z This paper shows a relationship between two di erent approximation techniques: the Support Vector Machines (SVM), proposed by V.Vapnik (1995), ..."
Abstract

Cited by 243 (7 self)
 Add to MetaCart
(the dictionary). We show that, if the data are noiseless, the modi ed version of Basis Pursuit DeNoising proposed in this paper is equivalent to SVM in the following sense: if applied to the same data set the two techniques give the same solution, which is obtained by solving the same quadratic
Results 1  10
of
4,804