2489 search results - page 276 / 498 » On the Subgroup Distance Problem |
135
click to vote
WADS
1997
Springer
15 years 8 months ago
1997
Springer
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
137
click to vote
FOCS
1992
IEEE
15 years 8 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
154
click to vote
ECML
2006
Springer
15 years 8 months ago
2006
Springer
A critical problem in clustering research is the definition of a proper metric to measure distances between points. Semi-supervised clustering uses the information provided by the ...
126
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here ali...
120
click to vote
PATAT
2000
Springer
15 years 8 months ago
2000
Springer
The main aim of this paper is to consider university examination timetabling problems as multicriteria decision problems. A new multicriteria approach to solving such problems is p...