1132 search results - page 133 / 227 » Similarity Graphs |
NAACL
2003
14 years 11 months ago
2003
We describe a simple unsupervised technique for learning morphology by identifying hubs in an automaton. For our purposes, a hub is a node in a graph with in-degree greater than o...
MVA
1998
14 years 11 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
CAGD
2006
14 years 10 months ago
2006
It is shown that polynomial (or rational) parametric surfaces with a linear field of normal vectors are dual to graphs bivariate polynomials (or rational functions). We discuss th...
COMBINATORICS
2006
14 years 10 months ago
2006
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...
FGCS
2000
14 years 9 months ago
2000
The LOGFLOW parallel Prolog system is similar to the recent parallel database systems concerning its dataflow execution model and its capability of running on othing architectures...