Sciweavers

275 search results - page 27 / 55
» Component factors with large components in graphs
Sort
View
IPPS
1996
IEEE
15 years 3 months ago
A New Approach to Pipeline FFT Processor
A new VLSI architecture for real-time pipeline FFT processor is proposed. A hardware oriented radix-22 algorithm is derived by integrating a twiddle factor decomposition technique ...
Shousheng He, Mats Torkelson
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
15 years 12 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
PPOPP
2012
ACM
13 years 7 months ago
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
James A. Edwards, Uzi Vishkin
MVA
1990
15 years 27 days ago
Raster to Vector Conversion in a Map Interpretation System
This paper describesthe two components: thinning and vectorization,at the front end of a GeographicInformation System. The raster dataset associatedwith a map is very large. A sma...
Paul C. K. Kwok, T. John Turner
CGF
2004
145views more  CGF 2004»
14 years 11 months ago
The State of the Art in Flow Visualization: Dense and Texture-Based Techniques
Flow visualization has been a very attractive component of scientific visualization research for a long time. Usually very large multivariate datasets require processing. These da...
Robert S. Laramee, Helwig Hauser, Helmut Doleisch,...