The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A simple polynomial-time algorithm is presented which computes independent sets of guaranteed size in connected triangle-free noncubic graphs with maximum degree 3. Let n and m denote the number of vertices and edges, respectively, and let c = m/n denote the edge density where c < 3/2. The algorithm establishes new lower bounds on the independence ratio of these graphs for 1 < c < 3/2.
A procedure for computing three-layer neural networks that classify patterns using the nearest neighbor rule is presented. The procedure constructs a neural network with expected O(n) neurons while requiring expected O(n) computation time for n uniformly distributed training patterns.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.