Sciweavers

1487 search results - page 191 / 298
» Representing and Querying Data Transformations
Sort
View
IMR
2003
Springer
15 years 7 months ago
Compact Representations of Simplicial Meshes in Two and Three Dimensions
We describe data structures for representing simplicial meshes compactly while supporting online queries and updates efficiently. Our data structure requires about a factor of fi...
Daniel K. Blandford, Guy E. Blelloch, David E. Car...
137
Voted
KDD
1997
ACM
213views Data Mining» more  KDD 1997»
15 years 5 months ago
A Probabilistic Approach to Fast Pattern Matching in Time Series Databases
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
Eamonn J. Keogh, Padhraic Smyth
DEXA
2009
Springer
151views Database» more  DEXA 2009»
15 years 8 months ago
Automatic Extraction of Ontologies Wrapping Relational Data Sources
Describing relational data sources (i.e. databases) by means of ontologies constitutes the foundation of most of the semantic based approaches to data access and integration. In sp...
Lina Lubyte, Sergio Tessaris
DKE
2008
79views more  DKE 2008»
15 years 1 months ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis
CIDR
2011
224views Algorithms» more  CIDR 2011»
14 years 5 months ago
Transactional Intent
Data state in a data management system such as a database is the result of the transactions performed on that data management system. Approaches such as single-message transaction...
Shel Finkelstein, Thomas Heinzel, Rainer Brendle, ...