scholarly journals Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams

Author(s):  
Sayan Bhattacharya ◽  
Monika Henzinger ◽  
Danupon Nanongkai ◽  
Charalampos Tsourakakis
Algorithmica ◽  
2007 ◽  
Vol 48 (1) ◽  
pp. 23-36 ◽  
Author(s):  
Wing-Kai Hon ◽  
Tak-Wah Lam ◽  
Kunihiko Sadakane ◽  
Wing-Kin Sung ◽  
Siu-Ming Yiu

2010 ◽  
Vol 15 (3) ◽  
pp. 327-353 ◽  
Author(s):  
Weiren Yu ◽  
Wenjie Zhang ◽  
Xuemin Lin ◽  
Qing Zhang ◽  
Jiajin Le

Author(s):  
P.J. Phillips ◽  
J. Huang ◽  
S. M. Dunn

In this paper we present an efficient algorithm for automatically finding the correspondence between pairs of stereo micrographs, the key step in forming a stereo image. The computation burden in this problem is solving for the optimal mapping and transformation between the two micrographs. In this paper, we present a sieve algorithm for efficiently estimating the transformation and correspondence.In a sieve algorithm, a sequence of stages gradually reduce the number of transformations and correspondences that need to be examined, i.e., the analogy of sieving through the set of mappings with gradually finer meshes until the answer is found. The set of sieves is derived from an image model, here a planar graph that encodes the spatial organization of the features. In the sieve algorithm, the graph represents the spatial arrangement of objects in the image. The algorithm for finding the correspondence restricts its attention to the graph, with the correspondence being found by a combination of graph matchings, point set matching and geometric invariants.


2020 ◽  
Author(s):  
Marco Patriarca ◽  
Els Heinsalu ◽  
Jean Leó Leonard
Keyword(s):  

Author(s):  
Alain Connes ◽  
Michael Heller ◽  
Roger Penrose ◽  
John Polkinghorne ◽  
Andrew Taylor
Keyword(s):  

1979 ◽  
Vol 24 (10) ◽  
pp. 824-824 ◽  
Author(s):  
DONALD B. LINDSLEY
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document