2489 search results - page 121 / 498 » On the Subgroup Distance Problem |
128
click to vote
SIAMCO
2000
15 years 3 months ago
2000
We study a class of functional which can be used for matching objects which can be represented as mappings from a fixed interval, I, to some "feature space." This class o...
124
click to vote
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— The localization problem is to determine an assignment of coordinates to nodes in a wireless ad-hoc or sensor network that is consistent with measured pairwise node dis...
137
click to vote
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
129
click to vote
SIAMCOMP
2010
15 years 2 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
118
click to vote
ICIP
2004
IEEE
16 years 5 months ago
2004
IEEE
In this paper we discuss the feasibility of using singular points in a scale space representation (referred to as top points) for image matching purposes. These points are easily ...