Sciweavers

1172 search results - page 141 / 235
» Path Algorithms on Regular Graphs
Sort
View
118
Voted
IPPS
1996
IEEE
15 years 6 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
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 2 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
CORR
2010
Springer
142views Education» more  CORR 2010»
15 years 1 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna
113
Voted
ACMACE
2008
ACM
15 years 4 months ago
Extracting camera-control requirements and camera movement generation in a 3D virtual environment
This paper proposes a new method to generate smooth camera movement that is collision-free in a three-dimensional virtual environment. It generates a set of cells based on cell de...
Hirofumi Hamazaki, Shinya Kitaoka, Maya Ozaki, Yos...
COMPGEOM
2005
ACM
15 years 4 months ago
The Visibility-Voronoi Complex and Its Applications
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
Ron Wein, Jur P. van den Berg, Dan Halperin