Results 1  10
of
840
Survey of clustering data mining techniques
, 2002
"... Accrue Software, Inc. Clustering is a division of data into groups of similar objects. Representing the data by fewer clusters necessarily loses certain fine details, but achieves simplification. It models data by its clusters. Data modeling puts clustering in a historical perspective rooted in math ..."
Abstract

Cited by 408 (0 self)
 Add to MetaCart
Accrue Software, Inc. Clustering is a division of data into groups of similar objects. Representing the data by fewer clusters necessarily loses certain fine details, but achieves simplification. It models data by its clusters. Data modeling puts clustering in a historical perspective rooted
Mesh Optimization
, 1993
"... We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh wH, produce a mesh w, of the same topological type as wH, that fits the data well and has a small number of vertices. Our approach is to minimize an energy f ..."
Abstract

Cited by 392 (8 self)
 Add to MetaCart
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh wH, produce a mesh w, of the same topological type as wH, that fits the data well and has a small number of vertices. Our approach is to minimize an energy
Syntactic Simplification
, 2000
"... In this thesis, we consider the task of syntactic simplification, in which one wishes to transform syntacticallycomplex natural language text into a form that is semantically equivalent but syntactically straightforward. We focus on using simplification to ease reading for aphasiacs, patients who s ..."
Abstract
 Add to MetaCart
suffer from a particular type of brain damage that results in severe linguistic deficits. We discuss some of the linguistic and computational difficulties that arise in the simplification task, and describe in detail the endocrine System, our system for simplification.
Quadricbased simplification in any dimension
 ACM TRANS GRAPH
, 2005
"... We present a new method for simplifying simplicial complexes of any type embedded in Euclidean spaces of any dimension. At the heart of this system is a novel generalization of the quadric error metric used in surface simplification. We demonstrate that our generalized simplification system can pr ..."
Abstract

Cited by 42 (3 self)
 Add to MetaCart
We present a new method for simplifying simplicial complexes of any type embedded in Euclidean spaces of any dimension. At the heart of this system is a novel generalization of the quadric error metric used in surface simplification. We demonstrate that our generalized simplification system can
Algebraic Simplification: A Guide for the Perplexed
, 1971
"... Algebraic simplification is examined first from the point of view of a user who needs to comprehend a large expression, and second from the point of view of a designer who wants to construct a useful and efficient system. First we describe various techniques akin to substitution. These techniques ca ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
can be used to decrease the size of an expression and make it more intelligible to a user. Then we delineate the spectrum of approaches to the design of automatic simplification capabilities in an algebraic manipulation system. Systems are divided into five types. Each type provides different
Simple TypeTheoretic Foundations for ObjectOriented Programming
, 1993
"... We develop a formal, typetheoretic account of the basic mechanisms of objectoriented programming: encapsulation, message passing, subtyping, and inheritance. By modeling object encapsulation in terms of existential types instead of the recursive records used in other recent studies, we obtain a s ..."
Abstract

Cited by 160 (17 self)
 Add to MetaCart
substantial simplification both in the model of objects and in the underlying typed calculus.
Type Inference and Simplification for Recursively Constrained Types
 In Actes du GDR Programmation
, 1995
"... This paper studies type inference for a functional language with subtyping, and focuses on the issue of simplifying inferred types. It does not attempt to give a fully detailed, formal framework; this shall be the topic of a forthcoming paper. ..."
Abstract
 Add to MetaCart
This paper studies type inference for a functional language with subtyping, and focuses on the issue of simplifying inferred types. It does not attempt to give a fully detailed, formal framework; this shall be the topic of a forthcoming paper.
Viewdependent Polygonal Simplification
"... This paper describes methods for viewdependent simplification of polygonal environments. A description of a refinement algorithm and different types of selective refinement criteria that the algorithm could be applied to is given. An imaginative scene helps to illustrate the workings of the algorit ..."
Abstract
 Add to MetaCart
This paper describes methods for viewdependent simplification of polygonal environments. A description of a refinement algorithm and different types of selective refinement criteria that the algorithm could be applied to is given. An imaginative scene helps to illustrate the workings
A SIMPLIFICATION FUNCTOR FOR COALGEBRAS
"... For an arbitrarytype functor F, the notion of split coalgebras, that is, coalgebras for which the canonical projections onto the simple factor split, generalizes the wellknown notion of simple coalgebras. In case F weakly preserves kernels, the passage from a coalgebra to its simple factor is fun ..."
Abstract
 Add to MetaCart
For an arbitrarytype functor F, the notion of split coalgebras, that is, coalgebras for which the canonical projections onto the simple factor split, generalizes the wellknown notion of simple coalgebras. In case F weakly preserves kernels, the passage from a coalgebra to its simple factor
A SIMPLIFICATION FUNCTOR FOR COALGEBRAS
"... For an arbitrarytype functor F, the notion of split coalgebras, that is, coalgebras for which the canonical projections onto the simple factor split, generalizes the wellknown notion of simple coalgebras. In case F weakly preserves kernels, the passage from a coalgebra to its simple factor is fun ..."
Abstract
 Add to MetaCart
For an arbitrarytype functor F, the notion of split coalgebras, that is, coalgebras for which the canonical projections onto the simple factor split, generalizes the wellknown notion of simple coalgebras. In case F weakly preserves kernels, the passage from a coalgebra to its simple factor
Results 1  10
of
840