Sciweavers

3267 search results - page 48 / 654
» Generalized quasirandom graphs
Sort
View
ICPP
2009
IEEE
15 years 5 months ago
Generalizing k-Betweenness Centrality Using Short Paths and a Parallel Multithreaded Implementation
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according...
Karl Jiang, David Ediger, David A. Bader
3DIM
2007
IEEE
15 years 5 months ago
Generalized MPU Implicits Using Belief Propagation
In this paper, we present a new algorithm to reconstruct 3D surfaces from an unorganized point cloud based on generalizing the MPU implicit algorithm through introducing a powerfu...
Yi-Ling Chen, Shang-Hong Lai, Tung-Ying Lee
CCCG
2009
15 years 5 days ago
Generalized jewels and the point placement problem
The point placement problem is to determine the positions of a linear set of points, P = {p1, p2, p3, . . . , pn}, uniquely, up to translation and reflection, from the fewest poss...
Md. Shafiul Alam, Asish Mukhopadhyay, Animesh Sark...
ICDAR
2003
IEEE
15 years 4 months ago
An Evolutionary Algorithm for General Symbol Segmentation
A new system is presented for general symbol segmentation, which is applicable for segmentation of any connected string of symbols, including characters and line diagrams. Using a...
Stephen Pearce, Maher Ahmed
ICCAD
1994
IEEE
101views Hardware» more  ICCAD 1994»
15 years 3 months ago
A general framework for vertex orderings, with applications to netlist clustering
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...
Charles J. Alpert, Andrew B. Kahng