In this note we study the existence of a solution to the survey-propagation equations for the random K-satisfiability problem for a given instance. We conjecture that when the num...
For a graph G, let P(G; ) be its chromatic polynomial and let [G] be the set of graphs having P(G; ) as their chromatic polynomial. We call [G] the chromatic equivalence class of ...
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, ...
This study examined the unique contribution of computer-based instruction when compared with more conventional modes of instruction (i.e. teacher instruction with textbooks) to ear...
In Lp-spaces with p [1, ) there exists a best approximation mapping to the set of functions computable by Heaviside perceptron networks with n hidden units; however for p (1, ) ...
In this paper we present a new technique for visualizing multidimensional information. We describe objects of a higher dimensional information space as small closed free-form-surf...