Results 1  10
of
3,465,920
A QPTAS for the Base of the Number of Triangulations of a Planar Point Set
"... The number of triangulations of a planar n point set is known to be cn, where the base c lies between 2.43 and 30. The fastest known algorithm for counting triangulations of a planar n point set runs in O∗(2n) time. The fastest known arbitrarily close approximation algorithm for the base of the numb ..."
Abstract
 Add to MetaCart
The number of triangulations of a planar n point set is known to be cn, where the base c lies between 2.43 and 30. The fastest known algorithm for counting triangulations of a planar n point set runs in O∗(2n) time. The fastest known arbitrarily close approximation algorithm for the base
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 674 (15 self)
 Add to MetaCart
in a more gen eral setting? We compare the marginals com puted using loopy propagation to the exact ones in four Bayesian network architectures, including two realworld networks: ALARM and QMR. We find that the loopy beliefs of ten converge and when they do, they give a good approximation
Bilattices and the Semantics of Logic Programming
, 1989
"... Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap's fourvalued logic, based on classical twovalued logic. Among other examples are those based on finite manyvalued logics, and on prob ..."
Abstract

Cited by 444 (13 self)
 Add to MetaCart
, and on probabilistic valued logic. A fixed point semantics is developed for logic programming, allowing any bilattice as the space of truth values. The mathematics is little more complex than in the classical twovalued setting, but the result provides a natural semantics for distributed logic programs, including
A Fluidbased Analysis of a Network of AQM Routers Supporting TCP Flows with an Application to RED
 Proc. SIGCOMM 2000
, 2000
"... In this paper we use jump process driven Stochastic Differential Equations to model the interactions of a set of TCP flows and Active Queue Management routers in a network setting. We show how the SDEs can be transformed into a set of Ordinary Differential Equations which can be easily solved numeri ..."
Abstract

Cited by 416 (21 self)
 Add to MetaCart
In this paper we use jump process driven Stochastic Differential Equations to model the interactions of a set of TCP flows and Active Queue Management routers in a network setting. We show how the SDEs can be transformed into a set of Ordinary Differential Equations which can be easily solved
DBpedia  A Crystallization Point for the Web of Data
, 2009
"... The DBpedia project is a community effort to extract structured information from Wikipedia and to make this information accessible on the Web. The resulting DBpedia knowledge base currently describes over 2.6 million entities. For each of these entities, DBpedia defines a globally unique identifier ..."
Abstract

Cited by 372 (36 self)
 Add to MetaCart
. Over the last year, an increasing number of data publishers have begun to set datalevel links to DBpedia resources, making DBpedia a central interlinking hub for the emerging Web of data. Currently, the Web of interlinked data sources around DBpedia provides approximately 4.7 billion pieces
The Number of Triangulations on Planar Point Sets
, 2006
"... We give a brief account of results concerning the number of triangulations on finite point sets in the plane, both for arbitrary sets and for specific sets such as the n×n integer lattice. ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We give a brief account of results concerning the number of triangulations on finite point sets in the plane, both for arbitrary sets and for specific sets such as the n×n integer lattice.
Segmentation using eigenvectors: A unifying view
 In ICCV
, 1999
"... Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using methods that are based on eigenvectors of the a nity matrix. These approaches are extremely attractive in that they are ..."
Abstract

Cited by 379 (1 self)
 Add to MetaCart
Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using methods that are based on eigenvectors of the a nity matrix. These approaches are extremely attractive
Retiming Synchronous Circuitry
 ALGORITHMICA
, 1991
"... This paper describes a circuit transformation called retiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit as a whole is preserved. We show that retiming can be used to transform a given synchronous circui ..."
Abstract

Cited by 376 (3 self)
 Add to MetaCart
This paper describes a circuit transformation called retiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit as a whole is preserved. We show that retiming can be used to transform a given synchronous
Parameter control in evolutionary algorithms
 IEEE Transactions on Evolutionary Computation
"... Summary. The issue of setting the values of various parameters of an evolutionary algorithm is crucial for good performance. In this paper we discuss how to do this, beginning with the issue of whether these values are best set in advance or are best changed during evolution. We provide a classifica ..."
Abstract

Cited by 363 (42 self)
 Add to MetaCart
classification of different approaches based on a number of complementary features, and pay special attention to setting parameters onthefly. This has the potential of adjusting the algorithm to the problem while solving the problem. This paper is intended to present a survey rather than a set of prescriptive
Counting Triangulations of Planar Point Sets
"... We study the maximal number of triangulations that a planar set of n points can have, and show that it is at most 30 n. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has led to the previous best upper bound of 43^n for the problem. More ..."
Abstract

Cited by 20 (6 self)
 Add to MetaCart
We study the maximal number of triangulations that a planar set of n points can have, and show that it is at most 30 n. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has led to the previous best upper bound of 43^n for the problem
Results 1  10
of
3,465,920