Sciweavers

2694 search results - page 64 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
15 years 1 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...
EUROCOLT
1999
Springer
15 years 2 months ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
NIPS
2004
14 years 11 months ago
A Second Order Cone programming Formulation for Classifying Missing Data
We propose a convex optimization based strategy to deal with uncertainty in the observations of a classification problem. We assume that instead of a sample (xi, yi) a distributio...
Chiranjib Bhattacharyya, Pannagadatta K. Shivaswam...
ICIP
2007
IEEE
15 years 4 months ago
Sparse Gradient Image Reconstruction Done Faster
In a wide variety of imaging applications (especially medical imaging), we obtain a partial set or subset of the Fourier transform of an image. From these Fourier measurements, we...
Ray Maleh, Anna C. Gilbert, Martin J. Strauss
ATAL
2008
Springer
14 years 11 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan