1814 search results - page 71 / 363 » Improved Results on Geometric Hitting Set Problems |
ISDA
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract—This paper introduces and compares some techniques used to predict the student performance at the university. Recently, researchers have focused on applying machine lear...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
DAC
1989
ACM
14 years 2 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
COMPGEOM
2011
ACM
13 years 1 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
CVPR
2007
IEEE
15 years 5 days ago
2007
IEEE
A good distance metric is crucial for unsupervised learning from high-dimensional data. To learn a metric without any constraint or class label information, most unsupervised metr...