Sciweavers

352 search results - page 59 / 71
» Partitioning Graphs into Connected Parts
Sort
View
IAT
2008
IEEE
15 years 6 months ago
Adapting to Changing Resource Requirements for Coalition Formation in Self-Organized Social Networks
Coalition formation in social networks, consisting of a graph of interdependent agents, allows many choices of which task to select and with whom to partner in the social network....
Levi Barton, Vicki H. Allan
ASPDAC
2004
ACM
109views Hardware» more  ASPDAC 2004»
15 years 5 months 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
98
Voted
ICPR
2006
IEEE
16 years 24 days ago
Finding Text in Natural Scenes by Figure-Ground Segmentation
Much past research on finding text in natural scenes uses bottom-up grouping processes to detect candidate text features as a first processing step. While such grouping procedures...
Huiying Shen, James Coughlan
DAGSTUHL
2007
15 years 1 months ago
A Deeper Investigation of PageRank as a Function of the Damping Factor
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor α that spre...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
TC
1998
14 years 11 months ago
Regular Sparse Crossbar Concentrators
A bipartite concentrator is a single stage sparse crossbar switching device that can connect any m of its n ≥ m inputs to its m outputs possibly without the ability to distingui...
Weiming Guo, A. Yavuz Oruç