5606 search results - page 533 / 1122 » Randomization Techniques for Graphs. |
158
click to vote
NAACL
2003
15 years 8 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...
193
click to vote
APWEB
2010
Springer
15 years 7 months ago
2010
Springer
SimRank has been proposed to rank web documents based on a graph model on hyperlinks. The existing techniques for conducting SimRank computation adopt an iteration computation para...
221
click to vote
CAV
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
183
click to vote
INFOCOM
2006
IEEE
16 years 1 months ago
2006
IEEE
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
230
click to vote
ECCV
2008
Springer
16 years 9 months ago
2008
Springer
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...