Sciweavers

1888 search results - page 100 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
ICCV
2003
IEEE
16 years 6 months ago
Shape and Motion under Varying Illumination: Unifying Structure from Motion, Photometric Stereo, and Multi-view Stereo
This paper presents an algorithm for computing optical flow, shape, motion, lighting, and albedo from an image sequence of a rigidly-moving Lambertian object under distant illumin...
Li Zhang, Brian Curless, Aaron Hertzmann, Steven M...
VLDB
1994
ACM
137views Database» more  VLDB 1994»
15 years 8 months ago
Performance of Data-Parallel Spatial Operations
The performance of data-parallel algorithms for spatial operations using data-parallel variants of the bucket PMR quadtree, R-tree, and R+-tree spatial data structures is compared...
Erik G. Hoel, Hanan Samet
BDA
2007
15 years 6 months ago
A Framework for Distributed Spatial Indexing in Shared-Nothing Architectures
The paper presents a complete framework for spatial indexing support in a distributed setting. We consider a shared-nothing environment where a set of servers provides independent...
Cédric du Mouza, Witold Litwin, Philippe Ri...
WWW
2010
ACM
15 years 10 months ago
Data summaries for on-demand queries over linked data
Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering....
Andreas Harth, Katja Hose, Marcel Karnstedt, Axel ...
FCT
1995
Springer
15 years 8 months ago
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
Hristo Djidjev, Grammati E. Pantziou, Christos D. ...