Sciweavers

1888 search results - page 129 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
WCE
2007
15 years 5 months ago
A Distributed Energy Efficient Query Processing in Self-Organized Wireless Sensor Networks
—Spatial query execution is an essential functionality of a sensor network. Redundancy within a sensor network can be exploited to reduce the communication cost incurred in execu...
Meer A. Hamza, Sherin M. Youssef, Salma F. Fayed
CIKM
1999
Springer
15 years 9 months ago
Automatically Extracting Structure and Data from Business Reports
A considerable amount of clean semistructured data is internally available to companies in the form of business reports. However, business reports are untapped for data mining, da...
Stephen W. Liddle, Douglas M. Campbell, Chad Crawf...
DEXA
2005
Springer
80views Database» more  DEXA 2005»
15 years 10 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
SIGMOD
2004
ACM
241views Database» more  SIGMOD 2004»
16 years 4 months ago
SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases
This paper introduces the Scalable INcremental hash-based Algorithm (SINA, for short); a new algorithm for evaluating a set of concurrent continuous spatio-temporal queries. SINA ...
Mohamed F. Mokbel, Xiaopeng Xiong, Walid G. Aref
ACIVS
2006
Springer
15 years 10 months ago
Improvement of Conventional Deinterlacing Methods with Extrema Detection and Interpolation
Abstract. This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system, typically a spatio-temporal motio...
Jérôme Roussel, Pascal Bertolino, Mar...