Sciweavers

19 search results - page 3 / 4
» Equilibria, Fixed Points, and Complexity Classes
Sort
View
ICLP
2001
Springer
13 years 9 months ago
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smo...
ICML
2007
IEEE
14 years 6 months ago
Linear and nonlinear generative probabilistic class models for shape contours
We introduce a robust probabilistic approach to modeling shape contours based on a lowdimensional, nonlinear latent variable model. In contrast to existing techniques that use obj...
Graham McNeill, Sethu Vijayakumar
MOC
2010
13 years 2 days ago
Portrait of the four regular super-exponentials to base sqrt(2)
We introduce the concept of regular super-functions at a fixed point. It is derived from the concept of regular iteration. A super-function F of h is a solution of F(z+1)=h(F(z)). ...
Dmitrii Kouznetsov, Henryk Trappmann
KES
1998
Springer
13 years 9 months ago
Attractor systems and analog computation
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
Hava T. Siegelmann, Shmuel Fishman
MP
2010
150views more  MP 2010»
13 years 2 days ago
The algebraic degree of semidefinite programming
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
Jiawang Nie, Kristian Ranestad, Bernd Sturmfels