Sciweavers

7640 search results - page 513 / 1528
» Event Database Processing
Sort
View
COMPGEOM
2008
ACM
15 years 8 months ago
A simple and efficient kinetic spanner
We present a kinetic data structure for maintaining a (1+ )-spanner of size O(n/2 ) for a set of n moving points in the plane. Assuming the trajectories of the points can be descr...
Mohammad Ali Abam, Mark de Berg, Joachim Gudmundss...
CN
2006
114views more  CN 2006»
15 years 6 months ago
Contour maps: Monitoring and diagnosis in sensor networks
Large-scale sensor networks impose energy and communication constraints, thus it is difficult to collect data from each individual sensor node and process it at the sink. In this ...
Xiaoqiao Meng, Thyaga Nandagopal, Li Li, Songwu Lu
ICIP
2001
IEEE
16 years 8 months ago
Color image coding, indexing and retrieval using binary space partitioning tree
This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, tradition...
Guoping Qiu, S. Sudirman
VLDB
2002
ACM
101views Database» more  VLDB 2002»
16 years 6 months ago
Efficient similarity search for market basket data
Several organizations have developed very large market basket databases for the maintenance of customer transactions. New applications, e.g., Web recommendation systems, present th...
Alexandros Nanopoulos, Yannis Manolopoulos
ICDE
2010
IEEE
189views Database» more  ICDE 2010»
16 years 6 months ago
I/O-Efficient Statistical Computing with RIOT
Statistical analysis of massive data is becoming indispensable to science, commerce, and society today. Such analysis requires efficient, flexible storage support and special optim...
Jun Yang 0001, Weiping Zhang, Yi Zhang