596 search results - page 89 / 120 » Complexity Analysis by Graph Rewriting |
WADS
2001
Springer
14 years 16 days ago
2001
Springer
Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the first e...
CVPR
2000
IEEE
14 years 16 days ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
HT
1991
ACM
13 years 11 months ago
1991
ACM
Hypertext systems are being used in many applications because of their flexible structure and the great browsing freedom they give to diverse communities of users. However, this s...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
AAAI
2011
12 years 8 months ago
2011
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...