Sciweavers

559 search results - page 3 / 112
» Fast SDP Algorithms for Constraint Satisfaction Problems
Sort
View
SIAMJO
2010
100views more  SIAMJO 2010»
13 years 20 hour ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
SIAMSC
2008
182views more  SIAMSC 2008»
13 years 5 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
STOC
2006
ACM
100views Algorithms» more  STOC 2006»
14 years 5 months ago
On the solution-space geometry of random constraint satisfaction problems
Dimitris Achlioptas, Federico Ricci-Tersenghi
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 7 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
EUSFLAT
2009
145views Fuzzy Logic» more  EUSFLAT 2009»
13 years 3 months ago
Valued Constraint Satisfaction Problems Applied to Functional Harmony
Harmonization with four voices is a musical problem which is subject to hard constraints, which absolutely need to be fulfilled, as well as to soft constraints, which preferably ho...
Nele Verbiest, Chris Cornelis, Yvan Saeys