Sciweavers

7015 search results - page 172 / 1403
» Approximation algorithms for co-clustering
Sort
View
MTA
2010
108views more  MTA 2010»
13 years 8 months ago
A reduced-reference structural similarity approximation for videos corrupted by channel errors
Abstract In this paper we propose a reduced-reference quality assessment algorithm which computes an approximation of the Structural SIMilarity (SSIM) metrics exploiting coding too...
Marco Tagliasacchi, Giuseppe Valenzise, Matteo Nac...
ICML
2010
IEEE
13 years 10 months ago
A scalable trust-region algorithm with application to mixed-norm regression
We present a new algorithm for minimizing a convex loss-function subject to regularization. Our framework applies to numerous problems in machine learning and statistics; notably,...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
ESA
2008
Springer
153views Algorithms» more  ESA 2008»
13 years 11 months ago
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, S...
IJCAI
1997
13 years 11 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
FOCS
2009
IEEE
14 years 4 months ago
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
Zeev Nutov