Sciweavers

420 search results - page 73 / 84
» Generating random regular graphs
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 7 months ago
Connectivity in Sub-Poisson Networks
: We consider a class of point processes, which we call sub-Poisson; these are point processes that can be directionallyconvexly (dcx) dominated by some Poisson point process. The ...
Bartlomiej Blaszczyszyn, D. Yogeshwaran
ISVLSI
2007
IEEE
150views VLSI» more  ISVLSI 2007»
14 years 2 months ago
Minimum-Congestion Placement for Y-interconnects: Some studies and observations
— Y -interconnects for VLSI chips are based on the use of global and semi-global wiring in only 0◦ , 60◦ , and 120◦ . Though X-interconnects are fast replacing the traditio...
Tuhina Samanta, Prasun Ghosal, Hafizur Rahaman, Pa...
SAC
2003
ACM
14 years 29 days ago
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Günther R. Raidl, Bryant A. Julstrom
VLSID
2004
IEEE
292views VLSI» more  VLSID 2004»
14 years 8 months ago
NoCGEN: A Template Based Reuse Methodology for Networks on Chip Architecture
In this paper, we describe NoCGEN, a Network On Chip (NoC) generator, which is used to create a simulatable and synthesizable NoC description. NoCGEN uses a set of modularised rou...
Jeremy Chan, Sri Parameswaran
AAAI
2010
13 years 9 months ago
Diversifying Query Suggestion Results
In order to improve the user search experience, Query Suggestion, a technique for generating alternative queries to Web users, has become an indispensable feature for commercial s...
Hao Ma, Michael R. Lyu, Irwin King