Sciweavers

3758 search results - page 157 / 752
» A Complete Subsumption Algorithm
Sort
View
ICOIN
2004
Springer
15 years 3 months ago
On Generating Random Network Structures: Connected Graphs
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
Alexey S. Rodionov, Hyunseung Choo
ICCV
2005
IEEE
15 years 3 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
15 years 3 months ago
Evolving recurrent models using linear GP
Turing complete Genetic Programming (GP) models introduce the concept of internal state, and therefore have the capacity for identifying interesting temporal properties. Surprisin...
Xiao Luo, Malcolm I. Heywood, A. Nur Zincir-Heywoo...
ISAAC
2005
Springer
109views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Recursion Theoretic Operators for Function Complexity Classes
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
Kenya Ueno
COMPGEOM
2010
ACM
15 years 3 months ago
Visualizing 3D Euler spirals
This video describes a new type of 3D curves, which generalizes the family of 2D Euler spirals. They are defined as the curves having both their curvature and their torsion evolv...
Gur Harary, Ayellet Tal