Results 1  10
of
205,933
ReTiling Polygonal Surfaces
 Computer Graphics
, 1992
"... This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at various levels of detail is important for achieving high frame rates in interactive graphics applications and also for speed ..."
Abstract

Cited by 443 (3 self)
 Add to MetaCart
model and the new points that are to become vertices in the retiled surface. The new model is then created by removing each original vertex and locally retriangulating the surface in a way that matches the local connectedness of the initial surface. This technique for surface retessellation has been
Vertex
"... Abstract. The structural semantics of UMLbased metamodeling were recently explored[1], providing a characterization of the models adhering to a metamodel. In particular, metamodels can be converted to a set of constraints expressed in a decidable subset of firstorder logic, an extended Horn logic. ..."
Abstract
 Add to MetaCart
Abstract. The structural semantics of UMLbased metamodeling were recently explored[1], providing a characterization of the models adhering to a metamodel. In particular, metamodels can be converted to a set of constraints expressed in a decidable subset of firstorder logic, an extended Horn logic. We augment the constructive techniques found in logic programming, which are also based on an extended Horn logic, to produce constructive techniques for reasoning about models and metamodels. These methods have a number of practical applications: At the metalevel, it can be decided if a (composite) metamodel characterizes a nonempty set of models, and a member can be automatically constructed. At the modellevel, it can be decided if a submodel has an embeddeding in a wellformed model, and the larger model can be constructed. This amounts to automatic model construction from an incomplete model. We describe the concrete algorithms for constructively solving these problems, and provide concrete examples. 1 Preliminaries Metamodels, Domains, and Logic This paper describes constructive techniques, similar to those found in logic programming, for reasoning about domainspecific modeling languages (DSMLs) defined with metamodels. Before we proceed, we must describe how a metamodel can be viewed as a formal object that characterizes the wellformed models adhering to that metamodel. We will refer to the models that adhere to metamodel X as the models of metamodel X. In order to build some intuition for
vQ~
, 1993
"... This is to certify that this Thesis is an authentic record of research work carried out by Mr. G. Mohan Kumar under my supervision and guidance in the Centre for Earth Science Studies for Ph.D. Degree of the Cochin University of Science and Technology and no part of it has previously formed the basi ..."
Abstract
 Add to MetaCart
This is to certify that this Thesis is an authentic record of research work carried out by Mr. G. Mohan Kumar under my supervision and guidance in the Centre for Earth Science Studies for Ph.D. Degree of the Cochin University of Science and Technology and no part of it has previously formed the basis for the award of any other degree in any University.
The Complexity of Stochastic Games
 Information and Computation
, 1992
"... We consider the complexity of stochastic games  simple games of chance played by two players. We show that the problem of deciding which player has the greatest chance of winning the game is in the class NP " coNP. 1 Introduction We consider the complexity of a natural combinatorial problem ..."
Abstract

Cited by 206 (2 self)
 Add to MetaCart
, we assume that all vertices have exactly two (not necessarily distinct) neighbors, except for the sink vertices, which have no neighbors. The graph models a game between two players, 0 and 1. In the game, a token is initially placed on the start vertex, and at each step of the game the token is moved
Bayes Risk Weighted VQ and Learning VQ
 in Proceedings of the 1994 IEEE Data Compression Conference
, 1994
"... This paper examines two vector quantization algorithms which can combine the tasks of compression and classification: Bayes risk weighted vector quantization (BRVQ) proposed by Oehler et al., and Optimized Learning Vector Quantization 1 (OLVQ1) proposed by Kohonen et al. BRVQ uses a parameter to c ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This paper examines two vector quantization algorithms which can combine the tasks of compression and classification: Bayes risk weighted vector quantization (BRVQ) proposed by Oehler et al., and Optimized Learning Vector Quantization 1 (OLVQ1) proposed by Kohonen et al. BRVQ uses a parameter to control the tradeoff between compression and classification. BRVQ performance is studied for a range of values for four classification problems. Increasing the parameter in BRVQ is intended to improve classification performance. However, for two of the problems studied, increasing degraded classification performance. A majority rule reclassification of the final codebook (using only the training set) greatly improves high BRVQ performance for these cases. Finally, we compare the classification performance and mean Square error (MSE) performance of BRVQ to that of OLVQ1 for four classification problems. BRVQ with codebook reclassification is found to have a lower MSE than OLVQ1 while main...
A Fast Algorithm for Incremental Distance Calculation
 In IEEE International Conference on Robotics and Automation
, 1991
"... A simple and efficient algorithm for finding the closest points between two convex polyhedra is described here. Data from numerous experiments tested on a broad set of convex polyhedra on ! 3 show that the running time is roughly constant for finding closest points when nearest points are approxim ..."
Abstract

Cited by 186 (4 self)
 Add to MetaCart
are approximately known and is linear in total number of vertices if no special initialization is done. This algorithm can be used for collision detection, computation of the distance between two polyhedra in threedimensional space, and other robotics problems. It forms the heart of the motion planning algorithm
VQ MISMATCHES IN DIGITAL RECEIVERS
"... Adaptive compensation of analog frontend I/Q mismatches in digital receivers. ..."
Abstract
 Add to MetaCart
Adaptive compensation of analog frontend I/Q mismatches in digital receivers.
Identification of Dynamical Systems Using GMM with VQ Initialization
"... as a tool to construct local mappings of nonlinear MultiInput MultiOutput (MIMO) systems. In this work we combine the advantages of GMM with the Kalman filter. To improve the accuracy of the local linear mappings in a potentially large dimensional state space, we propose to initialize the GMM para ..."
Abstract
 Add to MetaCart
as a tool to construct local mappings of nonlinear MultiInput MultiOutput (MIMO) systems. In this work we combine the advantages of GMM with the Kalman filter. To improve the accuracy of the local linear mappings in a potentially large dimensional state space, we propose to initialize the GMM
Results 1  10
of
205,933