1888 search results - page 114 / 378 » Algorithms for Querying by Spatial Structure |
189
click to vote
ADVIS
2006
Springer
15 years 11 months ago
2006
Springer
Recently many researchers have focused on management of historical trajectories of moving objects due to numerous size of accumulated data over time. However, most of them are conc...
155
click to vote
HICSS
2010
IEEE
15 years 11 months ago
2010
IEEE
The disparity between data collected in rural and urban counties is often detrimental in the appropriate analysis of cancer care statistics. Low counts drastically affect the inci...
130
Voted
MICAI
2004
Springer
15 years 10 months ago
2004
Springer
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
240
click to vote
ICDE
1999
IEEE
16 years 6 months ago
1999
IEEE
This paper proposes methodologies to control the access of B-tree-indexed data in a batch and real-time fashion. Algorithms are proposed to insert, query, delete, and rebalance B-...
142
click to vote
EDBT
2009
ACM
15 years 9 months ago
2009
ACM
In this paper, we identify and solve a new type of spatial queries, called continuous visible nearest neighbor (CVNN) search. Given a data set P, an obstacle set O, and a query li...