Results 1  10
of
13,757
On Inducing ngons
"... In this paper, we establish a lower bound on the number of inducing simple ngons in gridlike arrangements of lines. We also show that the complexity associated with counting the number of inducing ngons in an arrangement of collinear segments is #Pcomplete. 1 ..."
Abstract
 Add to MetaCart
In this paper, we establish a lower bound on the number of inducing simple ngons in gridlike arrangements of lines. We also show that the complexity associated with counting the number of inducing ngons in an arrangement of collinear segments is #Pcomplete. 1
Inducing ngon of an arrangement of lines
"... We show that an arrangement A of n lines in general position in the plane with n ≥ 3 has an inducing polygon of size n. The proof is constructive, that is we describe an algorithm that constructs a simple ngon inducing A. 1 ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We show that an arrangement A of n lines in general position in the plane with n ≥ 3 has an inducing polygon of size n. The proof is constructive, that is we describe an algorithm that constructs a simple ngon inducing A. 1
Inducing ngon of a line arrangement
, 2008
"... We show that an arrangement A of n lines in general position in the plane has an inducing polygon of size n. The proof is constructive, that is, we describe an O(n log n) time algorithm that constructs a simple ngon inducing A. 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We show that an arrangement A of n lines in general position in the plane has an inducing polygon of size n. The proof is constructive, that is, we describe an O(n log n) time algorithm that constructs a simple ngon inducing A. 1
Inducing polygons of line arrangements
 Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), Lecture Notes in Computer Science (LNCS 5369
, 2008
"... Abstract. We show that an arrangement A of n lines in general position in the plane has an inducing polygon of size O(n). Additionally, we present a simple algorithm for finding an inducing npath for A in O(n log n) time and an algorithm that constructs an inducing ngon for a special class of line ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Abstract. We show that an arrangement A of n lines in general position in the plane has an inducing polygon of size O(n). Additionally, we present a simple algorithm for finding an inducing npath for A in O(n log n) time and an algorithm that constructs an inducing ngon for a special class
Inducing Features of Random Fields
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1997
"... We present a technique for constructing random fields from a set of training samples. The learning paradigm builds increasingly complex fields by allowing potential functions, or features, that are supported by increasingly large subgraphs. Each feature has a weight that is trained by minimizing the ..."
Abstract

Cited by 664 (14 self)
 Add to MetaCart
We present a technique for constructing random fields from a set of training samples. The learning paradigm builds increasingly complex fields by allowing potential functions, or features, that are supported by increasingly large subgraphs. Each feature has a weight that is trained by minimizing the KullbackLeibler divergence between the model and the empirical distribution of the training data. A greedy algorithm determines how features are incrementally added to the field and an iterative scaling algorithm is used to estimate the optimal values of the weights. The random field models and techniques introduced in this paper differ from those common to much of the computer vision literature in that the underlying random fields are nonMarkovian and have a large number of parameters that must be estimated. Relations to other learning approaches, including decision trees, are given. As a demonstration of the method, we describe its application to the problem of automatic word classifica...
A series of coverings of the regular ngon
, 2011
"... We define an infinite series of translation coverings of Veech’s doublengon for odd n ≥ 5 which share the same Veech group. Additionally we give an infinite series of translation coverings with constant Veech group of a regular ngon for even n ≥ 8. These families give rise to explicit examples of ..."
Abstract
 Add to MetaCart
We define an infinite series of translation coverings of Veech’s doublengon for odd n ≥ 5 which share the same Veech group. Additionally we give an infinite series of translation coverings with constant Veech group of a regular ngon for even n ≥ 8. These families give rise to explicit examples
Multiresolution Analysis of Arbitrary Meshes
, 1995
"... In computer graphics and geometric modeling, shapes are often represented by triangular meshes. With the advent of laser scanning systems, meshes of extreme complexity are rapidly becoming commonplace. Such meshes are notoriously expensive to store, transmit, render, and are awkward to edit. Multire ..."
Abstract

Cited by 605 (16 self)
 Add to MetaCart
In computer graphics and geometric modeling, shapes are often represented by triangular meshes. With the advent of laser scanning systems, meshes of extreme complexity are rapidly becoming commonplace. Such meshes are notoriously expensive to store, transmit, render, and are awkward to edit. Multiresolution analysis offers a simple, unified, and theoretically sound approach to dealing with these problems. Lounsbery et al. have recently developed a technique for creating multiresolution representations for a restricted class of meshes with subdivision connectivity. Unfortunately, meshes encountered in practice typically do not meet this requirement. In this paper we present a method for overcoming the subdivision connectivity restriction, meaning that completely arbitrary meshes can now be converted to multiresolution form. The method is based on the approximation of an arbitrary initial mesh M by a mesh M that has subdivision connectivity and is guaranteed to be within a specified tolerance. The key
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 557 (12 self)
 Add to MetaCart
We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to SDP. Next we present an interior point algorithm which converges to the optimal solution in polynomial time. The approach is a direct extension of Ye's projective method for linear programming. We also argue that most known interior point methods for linear programs can be transformed in a mechanical way to algorithms for SDP with proofs of convergence and polynomial time complexity also carrying over in a similar fashion. Finally we study the significance of these results in a variety of combinatorial optimization problems including the general 01 integer programs, the maximum clique and maximum stable set problems in perfect graphs, the maximum k partite subgraph problem in graphs, and va...
On the Private Provision of Public Goods
 Journal of Public Economics
, 1986
"... We consider a general model of the noncooperative provision of a public good. Under very weak assumptions there will always exist a unique Nash equilibrium in our model. A small redistribution of wealth among the contributing consumers will not change the equilibrium amount of the public good. Howe ..."
Abstract

Cited by 546 (8 self)
 Add to MetaCart
We consider a general model of the noncooperative provision of a public good. Under very weak assumptions there will always exist a unique Nash equilibrium in our model. A small redistribution of wealth among the contributing consumers will not change the equilibrium amount of the public good. However, larger redistributions of wealth will change the set of contributors and thereby change the equilibrium provision of the public good. We are able to characterize the properties and the comparative statics of the equilibrium in a quite complete way and to analyze the extent to which government provision of a public good ‘crowds out’ private contributions. 1.
Results 1  10
of
13,757