Sciweavers

1633 search results - page 144 / 327
» Planar Map Graphs
Sort
View
ICPP
1994
IEEE
14 years 2 months ago
Data-Parallel Spatial Join Algorithms
E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are presented. The domain consists of planar line segment data i.e., Bu...
Erik G. Hoel, Hanan Samet
ECCV
2010
Springer
13 years 10 months ago
Geodesic Shape Retrieval via Optimal Mass Transport
This paper presents a new method for 2-D and 3-D shape retrieval based on geodesic signatures. These signatures are high dimensional statistical distributions computed by extractin...
Julien Rabin, Gabriel Peyré, Laurent D. Coh...
MVA
2010
248views Computer Vision» more  MVA 2010»
13 years 5 months ago
A comparative evaluation of interest point detectors and local descriptors for visual SLAM
Abstract In this paper we compare the behavior of different interest points detectors and descriptors under the conditions needed to be used as landmarks in visionbased simultaneou...
Arturo Gil, Óscar Martínez Mozos, M&...
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
14 years 3 months ago
Large graph processing in the cloud
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
Rishan Chen, Xuetian Weng, Bingsheng He, Mao Yang
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
12 years 26 days ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh