Sciweavers

163 search results - page 29 / 33
» Fast Edge-Routing for Large Graphs
Sort
View
WAE
2001
281views Algorithms» more  WAE 2001»
13 years 9 months ago
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
David A. Bader, Ajith K. Illendula, Bernard M. E. ...
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
13 years 7 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte
TVCG
2008
112views more  TVCG 2008»
13 years 7 months ago
Vispedia: Interactive Visual Exploration of Wikipedia Data via Search-Based Integration
Abstract-Wikipedia is an example of the collaborative, semi-structured data sets emerging on the Web. These data sets have large, nonuniform schema that require costly data integra...
Bryan Chan, Leslie Wu, Justin Talbot, Mike Cammara...
ICPP
2006
IEEE
14 years 1 months ago
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
David A. Bader, Kamesh Madduri
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams