Sciweavers

3913 search results - page 170 / 783
» complexity 2006
Sort
View
FUIN
2002
108views more  FUIN 2002»
15 years 4 months ago
Approximate Entropy Reducts
We use information entropy measure to extend the rough set based notion of a reduct. We introduce the Approximate Entropy Reduction Principle (AERP). It states that any simplificat...
Dominik Slezak
IJCGA
2002
69views more  IJCGA 2002»
15 years 4 months ago
On Deletion in Delaunay Triangulations
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...
Olivier Devillers
INFORMATICALT
2002
63views more  INFORMATICALT 2002»
15 years 4 months ago
Layered Polynomial Filter Structures
It is shown that nonlinear Volterra, polynomial autoregressive, and bilinear filters have the same layered implementation procedure. Using the layered structure, the order of nonli...
Kazys Kazlauskas, Jaunius Kazlauskas
INFORMATICALT
2002
140views more  INFORMATICALT 2002»
15 years 4 months ago
Intelligent Initial Finite Element Mesh Generation for Solutions of 2D Problems
The new strategy for non-uniform initial FE mesh generation is presented in this paper. The main focus is set to a priori procedures that define the sizing function independent on ...
Lina Vasiliauskiene, Romualdas Bausys
116
Voted
INFSOF
2002
78views more  INFSOF 2002»
15 years 4 months ago
Flow insensitive points-to sets
Pointer analysis is an important part of source code analysis. Many programs that manipulate source code take points-to sets as part of their input. Points-to related data collect...
Paul Anderson, David Binkley, Genevieve Rosay, Tim...