1888 search results - page 80 / 378 » Algorithms for Querying by Spatial Structure |
125
click to vote
ACCV
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, a novel multi-scale nonlinear structure tensor based corner detection algorithm is proposed to improve effectively the classical Harris corner detector. By consideri...
123
click to vote
JCDCG
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
158
click to vote
MDM
2010
Springer
15 years 6 months ago
2010
Springer
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
152
click to vote
DIS
2006
Springer
15 years 8 months ago
2006
Springer
The purpose of this paper is two-fold: First, we give efficient algorithms for answering itemset support queries for collections of itemsets from various representations of the fre...
142
click to vote
DAWAK
1999
Springer
15 years 8 months ago
1999
Springer
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...