Sciweavers

1091 search results - page 25 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
SADM
2008
178views more  SADM 2008»
15 years 1 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
132
Voted
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 5 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
IM
2007
15 years 3 months ago
Compass: Cost of Migration-aware Placement in Storage Systems
— We investigate methodologies for placement and migration of logical data stores in virtualized storage systems leading to optimum system configuration in a dynamic workload sc...
Akshat Verma, Upendra Sharma, Rohit Jain, Koustuv ...
119
Voted
COMPGEOM
2010
ACM
15 years 6 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
DEBS
2008
ACM
15 years 3 months ago
Replica placement for high availability in distributed stream processing systems
A significant number of emerging on-line data analysis applications require the processing of data streams, large amounts of data that get updated continuously, to generate output...
Thomas Repantis, Vana Kalogeraki