2489 search results - page 159 / 498 » On the Subgroup Distance Problem |
135
click to vote
COMPGEOM
1990
ACM
15 years 8 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
142
click to vote
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper, we propose a novel graph embedding method for the problem of lipreading. To characterize the temporal connections among video frames of the same utterance, a new di...
128
click to vote
WEBNET
2000
15 years 5 months ago
2000
: On-line learning is one of the emerging needs of the information age. Access to education is going to become crucial for the success of our information society. Therefore a lot o...
142
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Traditional Non-Negative Matrix Factorization (NMF) [19] is a successful algorithm for decomposing datasets into basis function that have reasonable interpretation. One problem of...
140
click to vote
ENDM
2002
15 years 4 months ago
2002
Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in s...