Sciweavers

19 search results - page 4 / 4
» The Computational Complexity of One-Dimensional Sandpiles
Sort
View
ICDCS
2006
IEEE
14 years 9 days ago
ParRescue: Scalable Parallel Algorithm and Implementation for Biclustering over Large Distributed Datasets
Biclustering refers to simultaneously capturing correlations present among subsets of attributes (columns) and records (rows). It is widely used in data mining applications includ...
Jianhong Zhou, Ashfaq A. Khokhar
TMI
2011
127views more  TMI 2011»
13 years 1 months ago
Reconstruction of Large, Irregularly Sampled Multidimensional Images. A Tensor-Based Approach
Abstract—Many practical applications require the reconstruction of images from irregularly sampled data. The spline formalism offers an attractive framework for solving this prob...
Oleksii Vyacheslav Morozov, Michael Unser, Patrick...
GLOBECOM
2006
IEEE
14 years 10 days ago
Efficient Approximations for Call Admission Control Performance Evaluations in Multi-Service Networks
—Several dynamic call admission control (CAC) schemes for cellular networks have been proposed in the literature to reserve resources adaptively to provide the desired quality of...
Emre A. Yavuz, Victor C. M. Leung
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 6 months ago
Efficient and effective explanation of change in hierarchical summaries
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos...