3265 search results - page 62 / 653 » Representing Groups on Graphs |
126
Voted
PARELEC
2000
IEEE
15 years 8 months ago
2000
IEEE
The purpose of this paper is to demonstrate the implementation of an adaptable parallel architecture capable of system to task adaptation. The system implementation was based on X...
110
Voted
CADE
2008
Springer
16 years 3 months ago
2008
Springer
Security protocols are small programs designed to ensure properties such as secrecy of messages or authentication of parties in a hostile environment. In this paper we investigate ...
183
Voted
ICCV
1999
IEEE
16 years 4 months ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
138
Voted
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
128
Voted
IJAC
2008
15 years 3 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...