1439 search results - page 38 / 288 » Fast approximation of centrality |
FOCS
2000
IEEE
14 years 3 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
ICIP
2009
IEEE
15 years 19 hour ago
2009
IEEE
This paper presents a novel method to approximate shiftvariant Gaussian filtering of an image using a set of shiftinvariant Gaussian filters. This approximation affords filtering ...
CSIE
2009
IEEE
14 years 3 months ago
2009
IEEE
A new algorithm of image layer-presentation was proposed. The key concept of the algorithm was in that the image grayscale function f(x,y), which was comparatively irregular, was ...
COMPGEOM
2005
ACM
14 years 28 days ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
WAOA
2010
Springer
13 years 8 months ago
2010
Springer
We consider cut games where players want to cut themselves off from different parts of a network. These games arise when players want to secure themselves from areas of potential i...