The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- Global discretization of continuous attributes as preprocessing for machine learning (Q1125694) (← links)
- Tuning of a fuzzy classifier derived from data (Q1125779) (← links)
- Exploiting case-based independence for approximating marginal probabilities (Q1125781) (← links)
- Distributed matrix-free solution of large sparse linear systems over finite fields (Q1125817) (← links)
- Maximum planar sets that determine \(k\) distances (Q1126289) (← links)
- An aperiodic set of 13 Wang tiles (Q1126300) (← links)
- A small aperiodic set of Wang tiles (Q1126302) (← links)
- Wrappers for feature subset selection (Q1127360) (← links)
- Performing out-of-core FFTs on parallel disk systems (Q1128673) (← links)
- Overlay striping and optimal parallel I/O for modern applications (Q1128674) (← links)
- Polymorphic syntax definition (Q1129122) (← links)
- Learning neural networks for detection and classification of synchronous recurrent transient signals (Q1129218) (← links)
- Dual adaptive control of nonlinear stochastic systems using neural networks (Q1129691) (← links)
- Newton's method for convex programming and Tschebyscheff approximation (Q1131571) (← links)
- General purpose schedulers for database systems (Q1132632) (← links)
- A decision procedure for the order of regular events (Q1132636) (← links)
- Some combinatorial problems in the plane (Q1133547) (← links)
- Traversing binary trees simply and cheaply (Q1133898) (← links)
- Another efficient algorithm for convex hulls in two dimensions (Q1134526) (← links)
- Voronoi diagrams from convex hulls (Q1135110) (← links)
- The book thickness of a graph (Q1136775) (← links)
- Some perfect coloring properties of graphs (Q1136777) (← links)
- An algorithm for algebraic assignment problems (Q1138479) (← links)
- On maximal independent sets of vertices in claw-free graphs (Q1139605) (← links)
- Circumscription - a form of non-monotonic reasoning (Q1140440) (← links)
- The relative neighbourhood graph of a finite planar set (Q1141155) (← links)
- Selection and sorting with limited storage (Q1143174) (← links)
- Decomposition of regular matroids (Q1144028) (← links)
- Evaluation and comparison of two efficient probabilistic primality testing algorithms (Q1144064) (← links)
- Note on primitive permutation groups and a Diophantine equation (Q1144118) (← links)
- A measure of shared information in classes of patterns (Q1144389) (← links)
- On a problem of L. Fejes Toth (Q1144797) (← links)
- A lower bound for on-line bin packing (Q1144944) (← links)
- An asymptotic equivalent for the number of total preorders on a finite set (Q1145144) (← links)
- Asymptotic properties of minimax trees and game-searching procedures (Q1145506) (← links)
- Probabilistic analysis of some Euclidean clustering problems (Q1147633) (← links)
- Theorem proving with abstraction (Q1149799) (← links)
- A note on Ramsey numbers (Q1149967) (← links)
- Computable queries for relational data bases (Q1151060) (← links)
- Succinct representation of regular languages by Boolean automata (Q1151754) (← links)
- Some special Vapnik-Chervonenkis classes (Q1152158) (← links)
- Résolution des systèmes d'équations algébriques (Q1152212) (← links)
- Complement reducible graphs (Q1153105) (← links)
- A constructive proof of Tucker's combinatorial lemma (Q1153158) (← links)
- An optimal algorithm for computing the repetitions in a word (Q1155963) (← links)
- Computing a perfect strategy for nxn chess requires time exponential in n (Q1156090) (← links)
- Primitive permutation groups and a characterization of the odd graphs (Q1156229) (← links)
- A problem of Ulam on planar graphs (Q1156811) (← links)
- On a new digraph reconstruction conjecture (Q1159216) (← links)
- The complexity of logical theories (Q1159661) (← links)
