Sciweavers

3670 search results - page 331 / 734
» Linear Recursive Functions
Sort
View
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
15 years 6 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
15 years 5 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
ICPR
2006
IEEE
16 years 7 months ago
A Minimum Sphere Covering Approach to Pattern Classification
In this paper we present a minimum sphere covering approach to pattern classification that seeks to construct a minimum number of spheres to represent the training data and formul...
Jigang Wang, Predrag Neskovic, Leon N. Cooper
AE
2007
Springer
16 years 26 days ago
The Cooperative Royal Road: Avoiding Hitchhiking
We propose using the so called Royal Road functions as test functions for cooperative co-evolutionary algorithms (CCEAs). The Royal Road functions were created in the early 90’s ...
Gabriela Ochoa, Evelyne Lutton, Edmund K. Burke
ICASSP
2011
IEEE
14 years 10 months ago
A novel analytical approach to orthogonal bases extraction from AM-FM signals
This paper presents a new method for extracting orthogonal bases from AM-FM signals. Since AM-FM signals are non-stationary, appropriate basis functions are sought provided that i...
Mohammadali Sebghati, Hamidreza Amindavar