Sciweavers

1542 search results - page 153 / 309
» Redundancy in Spatial Databases
Sort
View
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
15 years 10 days 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...
CVPR
2006
IEEE
15 years 8 months ago
Discriminative Object Class Models of Appearance and Shape by Correlatons
This paper presents a new model of object classes which incorporates appearance and shape information jointly. Modeling objects appearance by distributions of visual words has rec...
Silvio Savarese, John M. Winn, Antonio Criminisi
ADBIS
2010
Springer
192views Database» more  ADBIS 2010»
15 years 4 months ago
The Objects Interaction Graticule for Cardinal Direction Querying in Moving Objects Data Warehouses
Cardinal directions have turned out to be very important qualitative spatial relations due to their numerous applications in spatial wayfinding, GIS, qualitative spatial reasoning ...
Ganesh Viswanathan, Markus Schneider
112
Voted
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
15 years 2 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
164
Voted
IEAAIE
2009
Springer
15 years 9 months ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...