Sciweavers

8728 search results - page 1387 / 1746
» On Reduct Construction Algorithms
Sort
View
AI
1999
Springer
15 years 6 months ago
Learning by Discovering Concept Hierarchies
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
Blaz Zupan, Marko Bohanec, Janez Demsar, Ivan Brat...
IPL
2002
118views more  IPL 2002»
15 years 6 months ago
Differential approximation results for the traveling salesman and related problems
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
Jérôme Monnot
JCT
1998
99views more  JCT 1998»
15 years 6 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
Shuhong Gao, Beth Novick, Ke Qiu
MP
1998
73views more  MP 1998»
15 years 6 months ago
On proving existence of feasible points in equality constrained optimization problems
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
R. Baker Kearfott
PAMI
2002
112views more  PAMI 2002»
15 years 6 months ago
Feature Space Trajectory Methods for Active Computer Vision
We advance new active object recognition algorithms that classify rigid objects and estimate their pose from intensity images. Our algorithms automatically detect if the class or p...
Michael A. Sipe, David Casasent
« Prev « First page 1387 / 1746 Last » Next »