Sciweavers

1110 search results - page 55 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
15 years 5 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
IEEECIT
2009
IEEE
15 years 6 months ago
Clustering of Software Systems Using New Hybrid Algorithms
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
Ali Safari Mamaghani, Mohammad Reza Meybodi
CCGRID
2009
IEEE
15 years 6 months ago
BLAST Application with Data-Aware Desktop Grid Middleware
—There exists numerous Grid middleware to develop and execute programs on the computational Grid, but they still require intensive work from their users. BitDew is made to facili...
Haiwu He, Gilles Fedak, Bing Tang, Franck Cappello
PAMI
2007
176views more  PAMI 2007»
14 years 10 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
89
Voted
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
15 years 11 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...