Sciweavers

662 search results - page 64 / 133
» Approximate Queries and Representations for Large Data Seque...
Sort
View
ESA
2010
Springer
183views Algorithms» more  ESA 2010»
13 years 8 months ago
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
Sorelle A. Friedler, David M. Mount
RTCSA
2008
IEEE
14 years 2 months ago
Efficient Query Processing for Tracing RFID Tags by Reordering Location Identifiers
This paper addresses the problem of using the Location IDentifier (LID) as the domain value of the index for trajectories of RFID tags and proposes the solution for solving this p...
Sungwoo Ahn, Bonghee Hong
SSDBM
1999
IEEE
118views Database» more  SSDBM 1999»
14 years 1 days ago
Evaluation of Ad Hoc OLAP: In-Place Computation
Large scale data analysis and mining activities, such as identifying interesting trends, making unusual patterns to stand out and verifying hypotheses, require sophisticated infor...
Damianos Chatziantoniou
SDM
2007
SIAM
109views Data Mining» more  SDM 2007»
13 years 9 months ago
Segmentations with Rearrangements
Sequence segmentation is a central problem in the analysis of sequential and time-series data. In this paper we introduce and we study a novel variation to the segmentation proble...
Aristides Gionis, Evimaria Terzi
BMCBI
2008
123views more  BMCBI 2008»
13 years 7 months ago
Shape based indexing for faster search of RNA family databases
Background: Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally ...
Stefan Janssen, Jens Reeder, Robert Giegerich