767 search results - page 43 / 154 » On Clustering Using Random Walks |
112
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...
129
click to vote
ALT
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
108
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this paper, we present an analytical method to evaluate the bit error rate (BER) of the ultra-wideband (UWB) system in the IEEE 802.15.4a standardized channel model. The IEE...
137
click to vote
IJCSA
2007
15 years 2 months ago
2007
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
161
click to vote
NIPS
2004
15 years 4 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...