Sciweavers

1888 search results - page 319 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
14 years 21 days ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
COMPGEOM
2007
ACM
13 years 11 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 5 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
ICCV
2009
IEEE
15 years 26 days ago
Scene Categorization from Low Definition Video
In this paper we present a new method for categorizing video sequences capturing different scene classes. This can be seen as a generalization of previous work on scene classific...
Paritosh Gupta, Sai Sankalp Arrabolu, Mathew Brown...
CVPR
2007
IEEE
14 years 10 months ago
Sensor noise modeling using the Skellam distribution: Application to the color edge detection
In this paper, we introduce the Skellam distribution as a sensor noise model for CCD or CMOS cameras. This is derived from the Poisson distribution of photons that determine the s...
Youngbae Hwang, Jun-Sik Kim, In-So Kweon