Sciweavers

3630 search results - page 584 / 726
» Fast Marching Methods
Sort
View
EDBT
2002
ACM
188views Database» more  EDBT 2002»
16 years 3 months ago
Approximate Processing of Multiway Spatial Joins in Very Large Databases
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Dimitris Papadias, Dinos Arkoumanis
EDBT
2004
ACM
145views Database» more  EDBT 2004»
16 years 3 months ago
CUBE File: A File Structure for Hierarchically Clustered OLAP Cubes
Abstract. Hierarchical clustering has been proved an effective means for physically organizing large fact tables since it reduces significantly the I/O cost during ad hoc OLAP quer...
Nikos Karayannidis, Timos K. Sellis, Yannis Kouvar...
ICDE
2010
IEEE
188views Database» more  ICDE 2010»
16 years 3 months ago
Space-efficient Online Approximation of Time Series Data: Streams, Amnesia, and Out-of-order
In this paper, we present an abstract framework for online approximation of time-series data that yields a unified set of algorithms for several popular models: data streams, amnes...
Sorabh Gandhi, Luca Foschini, Subhash Suri
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 15 days ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
EWSN
2010
Springer
16 years 12 days ago
Radio Interferometric Angle of Arrival Estimation
Abstract. Several localization algorithms exist for wireless sensor networks that use angle of arrival measurements to estimate node position. However, there are limited options fo...
Isaac Amundson, János Sallai, Xenofon D. Ko...