Sciweavers

7006 search results - page 566 / 1402
» Approximation Algorithms
Sort
View
ICTCS
2003
Springer
16 years 4 days ago
Cost Constrained Fixed Job Scheduling
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
Qiwei Huang, Errol L. Lloyd
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 7 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
APPROX
2008
Springer
135views Algorithms» more  APPROX 2008»
15 years 9 months ago
The Directed Minimum Latency Problem
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
Viswanath Nagarajan, R. Ravi
ICIP
2010
IEEE
15 years 4 months ago
Image analysis with regularized Laplacian eigenmaps
Many classes of image data span a low dimensional nonlinear space embedded in the natural high dimensional image space. We adopt and generalize a recently proposed dimensionality ...
Frank Tompkins, Patrick J. Wolfe
FUIN
2010
143views more  FUIN 2010»
15 years 4 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer