5100 search results - page 620 / 1020 » The Linear Complexity of a Graph |
183
click to vote
WADS
2001
Springer
15 years 11 months 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...
169
Voted
CVPR
2000
IEEE
15 years 11 months 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 ...
177
click to vote
PPSN
1992
Springer
15 years 10 months ago
1992
Springer
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
194
click to vote
AHS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we propose a design methodology for implementing a multimode (or multi-configuration) and multi-throughput system into a single hardware architecture. The inputs of...
197
click to vote
AOSD
2007
ACM
15 years 10 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...