3265 search results - page 32 / 653 » Representing Groups on Graphs |
110
Voted
EJC
2000
15 years 3 months ago
2000
107
click to vote
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
131
click to vote
EJC
2008
15 years 3 months ago
2008
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
111
Voted
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
We introduce a novel topological formulation for contour grouping. Our grouping criterion, called untangling cycles, exploits the inherent topological 1D structure of salient cont...
162
click to vote
IVC
2008
15 years 3 months ago
2008
In this paper, we address the issue of Euclidean path modeling in a single camera for activity monitoring in a multi-camera video surveillance system. The method consists of a pat...