Sciweavers

2489 search results - page 44 / 498
» On the Subgroup Distance Problem
Sort
View
IPPS
2002
IEEE
15 years 5 months ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
105
Voted
IJCV
2000
223views more  IJCV 2000»
15 years 19 days ago
The Earth Mover's Distance as a Metric for Image Retrieval
We investigate the properties of a metric between two distributions, the Earth Mover's Distance (EMD), for content-based image retrieval. The EMD is based on the minimal cost ...
Yossi Rubner, Carlo Tomasi, Leonidas J. Guibas
106
Voted
FUIN
2010
89views more  FUIN 2010»
14 years 11 months ago
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
Stavros Konstantinidis, Pedro V. Silva
109
Voted
IPPS
1998
IEEE
15 years 5 months ago
NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
Sven Venema, Hong Shen, Francis Suraweera
ICPR
2008
IEEE
15 years 7 months ago
An approach for video cut detection using bipartite graph matching as dissimilarity distance
The video segmentation problem consists in the identification of the boundary between consecutive shots. When two consecutive frames are similar, they are considered to be in the...
Silvio Jamil Ferzoli Guimarães, Zenilton Kl...