Results 1  10
of
4,340
A Signal Processing Approach To Fair Surface Design
, 1995
"... In this paper we describe a new tool for interactive freeform fair surface design. By generalizing classical discrete Fourier analysis to twodimensional discrete surface signals  functions defined on polyhedral surfaces of arbitrary topology , we reduce the problem of surface smoothing, or fai ..."
Abstract

Cited by 654 (15 self)
 Add to MetaCart
, to accommodate different types of constraints. Some constraints can be imposed without any modification of the algorithm, while others require the solution of a small associated linear system of equations. In particular, vertex location constraints, vertex normal constraints, and surface normal discontinuities
Nonlinear total variation based noise removal algorithms
, 1992
"... A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using the g ..."
Abstract

Cited by 2271 (51 self)
 Add to MetaCart
A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using
Dynamic programming algorithm optimization for spoken word recognition
 IEEE TRANSACTIONS ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING
, 1978
"... This paper reports on an optimum dynamic programming (DP) based timenormalization algorithm for spoken word recognition. First, a general principle of timenormalization is given using timewarping function. Then, two timenormalized distance definitions, ded symmetric and asymmetric forms, are der ..."
Abstract

Cited by 788 (3 self)
 Add to MetaCart
This paper reports on an optimum dynamic programming (DP) based timenormalization algorithm for spoken word recognition. First, a general principle of timenormalization is given using timewarping function. Then, two timenormalized distance definitions, ded symmetric and asymmetric forms
A Hierarchy of Semantics for Normal Constraint Logic Programs
 PROC. FIFTH INT'L CONF. ON ALGEBRAIC AND LOGIC PROGRAMMING, VOLUME 1139 OF LECTURE NOTES IN COMPUTER SCIENCE
, 1996
"... The different properties characterizing the operational behavior of logic programs can be organized in a hierarchy of fixpoint semantics related by Galois insertions, having the least Herbrand model as most abstract semantics, and the SLD operational semantics as most concrete semantics. The cho ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
by making them apply to normal (constraint) logic programs, that is full firstorder (non Horn) programs. The fixpoint semantics defined by the first author for the rule of constructive negation by pruning is at the center of the hierarchy developed in this paper. We show that that semantics can
The DLV System for Knowledge Representation and Reasoning
 ACM Transactions on Computational Logic
, 2002
"... Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believ ..."
Abstract

Cited by 456 (102 self)
 Add to MetaCart
believed assumptions, DLP is strictly more expressive than normal (disjunctionfree) logic programming, whose expressiveness is limited to properties decidable in NP. Importantly, apart from enlarging the class of applications which can be encoded in the language, disjunction often allows for representing
Direct least Square Fitting of Ellipses
, 1998
"... This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac  b² = 1 the new method incorporates the ellipticity constraint ..."
Abstract

Cited by 430 (3 self)
 Add to MetaCart
This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac  b² = 1 the new method incorporates the ellipticity constraint
Limits on superresolution and how to break them
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2002
"... AbstractÐNearly all superresolution algorithms are based on the fundamental constraints that the superresolution image should generate the low resolution input images when appropriately warped and downsampled to model the image formation process. �These reconstruction constraints are normally com ..."
Abstract

Cited by 421 (7 self)
 Add to MetaCart
AbstractÐNearly all superresolution algorithms are based on the fundamental constraints that the superresolution image should generate the low resolution input images when appropriately warped and downsampled to model the image formation process. �These reconstruction constraints are normally
Extending and Implementing the Stable Model Semantics
, 2002
"... A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization capabilities ..."
Abstract

Cited by 396 (9 self)
 Add to MetaCart
A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization
What memory is for
, 1997
"... Let’s start from scratch in thinking about what memory is for, and consequently, how it works. Suppose that memory and conceptualization work in the service of perception and action. In this case, conceptualization is the encoding of patterns of possible physical interaction with a threedimensiona ..."
Abstract

Cited by 396 (5 self)
 Add to MetaCart
what it means to be related) is determined by how separate patterns of actions can be combined given the constraints of our bodies. I call this combination “mesh. ” To avoid hallucination, conceptualization would normally be driven by the environment, and patterns of action from memory would play a
SIMULTANEOUS STRUCTURAL AND MANUFACTURING OPTIMIZATION OF COMPOSITE PARTS USING NORMAL CONSTRAINT METHOD
"... Due to the large number of design variables and objectives, the design of composite materials is more complex than the design of uniform isotropic materials. This is not only because of the anisotropic material properties but also because of the strong interconnection between design and manufacturin ..."
Abstract
 Add to MetaCart
Due to the large number of design variables and objectives, the design of composite materials is more complex than the design of uniform isotropic materials. This is not only because of the anisotropic material properties but also because of the strong interconnection between design and manufacturing issues. The optimized design of composite structures requires
Results 1  10
of
4,340