Sciweavers

1091 search results - page 104 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
SIGMOD
2004
ACM
144views Database» more  SIGMOD 2004»
14 years 8 months ago
Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data
Data items archived in data warehouses or those that arrive online as streams typically have attributes which take values from multiple hierarchies (e.g., time and geographic loca...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
MIRAGE
2007
Springer
14 years 2 months ago
Fitting Subdivision Surface Models to Noisy and Incomplete 3-D Data
Abstract. We describe an algorithm for fitting a Catmull-Clark subdivision surface model to an unstructured, incomplete and noisy data set. We complete the large missing data regi...
Spela Ivekovic, Emanuele Trucco
ICDE
2009
IEEE
171views Database» more  ICDE 2009»
14 years 9 months ago
A Framework for Clustering Massive-Domain Data Streams
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...
Charu C. Aggarwal
ICDM
2009
IEEE
121views Data Mining» more  ICDM 2009»
14 years 2 months ago
Finding Time Series Motifs in Disk-Resident Data
—Time series motifs are sets of very similar subsequences of a long time series. They are of interest in their own right, and are also used as inputs in several higher-level data...
Abdullah Mueen, Eamonn J. Keogh, Nima Bigdely Sham...
COLT
2010
Springer
13 years 6 months ago
Efficient Classification for Metric Data
Recent advances in large-margin classification of data residing in general metric spaces (rather than Hilbert spaces) enable classification under various natural metrics, such as ...
Lee-Ad Gottlieb, Leonid Kontorovich, Robert Krauth...