Sciweavers

822 search results - page 6 / 165
» Hashing Methods for Temporal Data
Sort
View
ICPP
2008
IEEE
14 years 2 months ago
Bounded LSH for Similarity Search in Peer-to-Peer File Systems
Similarity search has been widely studied in peer-to-peer environments. In this paper, we propose the Bounded Locality Sensitive Hashing (Bounded LSH) method for similarity search...
Yu Hua, Bin Xiao, Dan Feng, Bo Yu
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
13 years 11 months ago
Query Execution Techniques for Caching Expensive Methods
Object-Relational and Object-Oriented DBMSs allow users to invoke time-consuming ("expensive") methods in their queries. When queries containing these expensive methods a...
Joseph M. Hellerstein, Jeffrey F. Naughton
ADBIS
2009
Springer
101views Database» more  ADBIS 2009»
13 years 11 months ago
Temporal Data Classification Using Linear Classifiers
Data classification is usually based on measurements recorded at the same time. This paper considers temporal data classification where the input is a temporal database that descri...
Peter Z. Revesz, Thomas Triplet
AIPR
2006
IEEE
14 years 1 months ago
Data Fusion, De-noising, and Filtering to Produce Cloud-Free High Quality Temporal Composites Employing Parallel Temporal Map Al
Remotely sensed images from satellite sensors such as MODIS Aqua and Terra provide high temporal resolution and wide area coverage. Unfortunately, these images frequently include ...
Bijay Shrestha, Charles G. O'Hara, Preeti Mali
VLDB
2000
ACM
177views Database» more  VLDB 2000»
13 years 11 months ago
The BT-tree: A Branched and Temporal Access Method
Temporal databases assume a single line of time evolution. In other words, they support timeevolving data. However there are applications which require the support of temporal dat...
Linan Jiang, Betty Salzberg, David B. Lomet, Manue...