2463 search results - page 32 / 493 » Rankings of Directed Graphs |
159
click to vote
GLOBECOM
2007
IEEE
15 years 11 months ago
2007
IEEE
—In this paper, we clarify inter-link interference in wireless ad-hoc networks by using link-directional interference graphs (l-graph). Most of the interference graphs in the lit...
149
click to vote
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
Lattice-based approaches have been widely used in spoken document retrieval to handle the speech recognition uncertainty and errors. Position Specific Posterior Lattices (PSPL) an...
134
click to vote
WAW
2007
Springer
15 years 11 months ago
2007
Springer
Popular reputation systems for linked networks can be manipulated by spammers who strategically place links. The reputation of node v is interpreted as the world’s opinion of vâ...
145
Voted
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
This paper presents an approach to automatically optimize the retrieval quality of ranking functions. Taking a Swarm Intelligence perspective, we present a novel method, SwarmRank...
314
click to vote
SDM
2011
SIAM
14 years 8 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...