2489 search results - page 311 / 498 » On the Subgroup Distance Problem |
139
click to vote
NIPS
2008
15 years 5 months ago
2008
This paper introduces a new approach to constructing meaningful lower dimensional representations of sets of data points. We argue that constraining the mapping between the high a...
149
click to vote
SDM
2008
SIAM
15 years 5 months ago
2008
SIAM
Measuring similarity or distance between two entities is a key step for several data mining and knowledge discovery tasks. The notion of similarity for continuous data is relative...
140
click to vote
RSS
2007
15 years 5 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
135
click to vote
AVI
2006
15 years 5 months ago
2006
This paper reports our experience of evaluating an application that uses visualization approaches to support instructors in Web based distance education. The evaluation took place...
120
click to vote
CCCG
2006
15 years 5 months ago
2006
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...