Sciweavers

2463 search results - page 32 / 493
» Rankings of Directed Graphs
Sort
View
GLOBECOM
2007
IEEE
14 years 2 months ago
Colouring Link-Directional Interference Graphs in Wireless Ad Hoc Networks
—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...
Ping Chung Ng, David J. Edwards, Soung Chang Liew
ICASSP
2009
IEEE
13 years 11 months ago
Improved lattice-based spoken document retrieval by directly learning from the evaluation measures
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...
Chao-hong Meng, Hung-yi Lee, Lin-shan Lee
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
14 years 1 months ago
Manipulation-Resistant Reputations Using Hitting Time
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â...
John E. Hopcroft, Daniel Sheldon
GECCO
2009
Springer
151views Optimization» more  GECCO 2009»
14 years 2 months ago
Swarming to rank for information retrieval
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...
Ernesto Diaz-Aviles, Wolfgang Nejdl, Lars Schmidt-...
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 10 months ago
Clustered low rank approximation of graphs in information science applications
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...
Berkant Savas, Inderjit S. Dhillon