2489 search results - page 349 / 498 » On the Subgroup Distance Problem |
137
click to vote
PCI
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Given two datasets DA and DB the closest-pair query (CPQ) retrieves the pair (a,b), where a ∈ DA and b ∈ DB, having the smallest distance between all pairs of objects...
150
click to vote
ICML
2004
IEEE
15 years 9 months ago
2004
IEEE
We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...
128
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
A rectilinear Steiner arborescence connects points in the Euclidean plane’s first quadrant and the origin with directed rectilinear edges from the origin up and to the right. Th...
161
click to vote
IBERAMIA
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we tackle the problem of providing a mobile robot with the ability to build a map of its environment using data gathered during navigation. The data correspond to the...
116
click to vote
WEA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...