1949 search results - page 153 / 390 » Random graphs on surfaces |
143
click to vote
DSSCV
2005
Springer
15 years 10 months ago
2005
Springer
We show that the pre-symmetry set of a smooth surface in 3-space has the structure of the graph of a function from R2 to R2 in many cases of interest, generalising known results fo...
189
click to vote
DCG
2010
15 years 4 months ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
155
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
145
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
137
click to vote
IJAC
2008
15 years 4 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...