Sciweavers

2745 search results - page 134 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
DICTA
2003
15 years 5 months ago
Diamond, Hexagon, and General Polygonal Shaped Window Smoothing
Abstract. This paper presents fast recursive or moving windows algorithms for calculating local means in a diamond, hexagon and general polygonal shaped windows of an image. The al...
Changming Sun
NCA
2005
IEEE
15 years 9 months ago
Decentralized Schemes for Size Estimation in Large and Dynamic Groups
Large-scale and dynamically changing distributed systems such as the Grid, peer-to-peer overlays, etc., need to collect several kinds of global statistics in a decentralized manne...
Dionysios Kostoulas, Dimitrios Psaltoulis, Indrani...
SIAMNUM
2010
134views more  SIAMNUM 2010»
14 years 10 months ago
Nonequispaced Hyperbolic Cross Fast Fourier Transform
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
Michael Döhler, Stefan Kunis, Daniel Potts
WSCG
2001
91views more  WSCG 2001»
15 years 5 months ago
Fast Hybrid Block- and Pixel- Recursive Disparity Analysis for Real-Time Applications in Immersive Tele-Conference Scenarios
This paper presents a fast disparity analysis approach based on a hybrid block- and pixel-recursive matching scheme. The key idea is to choose efficiently a small number of candid...
Peter Kauff, Nicole Brandenburg, Michael Karl, Oli...
139
Voted
CGI
2000
IEEE
15 years 8 months ago
SQUEEZE: Fast and Progressive Decompression of Triangle Meshes
An ideal triangle mesh compression technology would simultaneously support the following three objectives: (1) progressive refinements of the received mesh during decompression, (...
Renato Pajarola, Jarek Rossignac