Sciweavers

2743 search results - page 73 / 549
» Minimization of an M-convex Function
Sort
View
CLOUDCOM
2009
Springer
14 years 1 months ago
Cost-Minimizing Scheduling of Workflows on a Cloud of Memory Managed Multicore Machines
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...
Nicolas G. Grounds, John K. Antonio, Jeffrey T. Mu...
ROBVIS
2001
Springer
114views Robotics» more  ROBVIS 2001»
14 years 1 months ago
A Wavelet-Based Algorithm for Height from Gradients
This paper presents a wavelet-based algorithm for height from gradients. The tensor product of the third-order Daubechies’ scaling functions is used to span the solution space. ...
Tiangong Wei, Reinhard Klette
ICPR
2008
IEEE
14 years 10 months ago
Continuous graph cuts for prior-based object segmentation
In this paper we propose a novel prior-based variational object segmentation method in a global minimization framework which unifies image segmentation and image denoising. The id...
Anders Heyden, Christian Gosch, Christoph Schn&oum...
ICASSP
2009
IEEE
14 years 4 months ago
Distributed subgradient projection algorithm for convex optimization
—We consider constrained minimization of a sum of convex functions over a convex and compact set, when each component function is known only to a specific agent in a timevarying...
Sundhar Srinivasan Ram, Angelia Nedic, Venugopal V...
KDD
2003
ACM
130views Data Mining» more  KDD 2003»
14 years 9 months ago
Towards systematic design of distance functions for data mining applications
Distance function computation is a key subtask in many data mining algorithms and applications. The most effective form of the distance function can only be expressed in the conte...
Charu C. Aggarwal