2463 search results - page 320 / 493 » Rankings of Directed Graphs |
113
click to vote
RANDOM
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
138
click to vote
HICSS
1995
IEEE
15 years 7 months ago
1995
IEEE
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
118
Voted
TNN
1998
15 years 3 months ago
1998
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
159
Voted
KDD
2012
ACM
13 years 5 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
152
click to vote
ICIP
2003
IEEE
16 years 5 months ago
2003
IEEE
We present algorithms for automatic feature selection for unsupervised structure discovery from video sequences. Feature selection in this scenario is hard because of the absence ...