Sciweavers

5592 search results - page 768 / 1119
» On Random Betweenness Constraints
Sort
View
198
Voted
WEBI
2005
Springer
16 years 10 days ago
WICER: A Weighted Inter-Cluster Edge Ranking for Clustered Graphs
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
Divya Padmanabhan, Prasanna Kumar Desikan, Jaideep...
198
Voted
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
16 years 9 days ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
190
Voted
ASPDAC
2004
ACM
109views Hardware» more  ASPDAC 2004»
16 years 9 days ago
Design methodology for IRA codes
Channel coding is an important building block in communication systems since it ensures the quality of service. Irregular repeat-accumulate (IRA) codes belong to the class of Low-...
Frank Kienle, Norbert Wehn
SIGIR
2004
ACM
16 years 8 days ago
GaP: a factor model for discrete data
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
John F. Canny
DBISP2P
2004
Springer
70views Database» more  DBISP2P 2004»
16 years 8 days ago
Using Information Retrieval Techniques to Route Queries in an InfoBeacons Network
We present the InfoBeacons system, in which a peer-to-peer network of beacons cooperates to route queries to the best information sources. The routing in our system uses techniques...
Brian F. Cooper