5606 search results - page 147 / 1122 » Randomization Techniques for Graphs. |
BROADNETS
2006
IEEE
14 years 4 months ago
2006
IEEE
: With the increase of the number of wavelengths per fiber waveband switching has been proposed to decrease the number of switching ports in optical nodes. Another concept that of ...
ICDM
2008
IEEE
14 years 5 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
CORR
1999
Springer
13 years 10 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
CIVR
2007
Springer
14 years 5 months ago
2007
Springer
The ability to match faces in video is a crucial component for many multimedia applications such as searching and recognizing people in semantic video browsing, surveillance and h...
FOCS
1993
IEEE
14 years 2 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...