Results 201 to 210 of about 113,518 (248)

Taylor Series Localization Algorithm Based on Semi-definite Programming

Lecture Notes in Computer Science, 2019
In order to improve the positioning accuracy of time difference of arrival, a Taylor series algorithm based on semi-definite programming is proposed in this paper. Firstly, base on the squared distance difference model, a semi-positive programming method is used to obtain the coarse location of the target node.
Jianfeng Lu, Xuanyuan Yang
exaly   +3 more sources

3D Chromosome Modeling with Semi-Definite Programming and Hi-C Data

Journal of Computational Biology, 2013
For a long period of time, scientists studied genomes while assuming they are linear. Recently, chromosome conformation capture (3C)-based technologies, such as Hi-C, have been developed that provide the loci contact frequencies among loci pairs in a genome-wide scale.
Kim-Chuan Toh, Wing-Kin Sung, Guoliang Li   +2 more
exaly   +4 more sources

Localisation algorithm based on weighted semi-definite programming

International Journal of Embedded Systems, 2020
Jianfeng Lu, Xuanyuan Yang
exaly   +3 more sources

A semi-definite programming approach for robust tracking

Mathematical Programming, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shimrit Shtern, A. Ben-Tal
semanticscholar   +2 more sources

Maximum Entropy-Based Semi-Definite Programming for Wireless Sensor Network Localization

IEEE Internet of Things Journal, 2019
Localization in wireless sensor networks means determination of sensor nodes coordination, and this can be done using the known positions of some other nodes (called anchors) and given distance measurements.
P. M. Ghari, Reza Shahbazian, S. Ghorashi   +2 more
semanticscholar   +1 more source

Semi-Definite Programming Based Scalable and Accurate Optimal Power Flow Models for Radial Distribution Networks

IEEE transactions on industry applications
With high integration of distributed energy resources (DERs), modern distribution networks are subject to optimal power flow (OPF) analysis. Conventional non-linear and linear OPF models suffer from either infeasibility or inaccuracy for large networks ...
M. Hasan, Mokter Mahmud Chowdhury, B. Biswas, S. Kamalasadan   +3 more
semanticscholar   +1 more source

Graph Seriation Using Semi-definite Programming

2005
Graph seriation is concerned with placing the nodes of a graph in a serial order so that edge consecutive constraints are generally preserved. It is an important task in network analysis problem in routine and bioinformatics. In this paper we show how the problem of graph seriation can be solved using semi-definite programming (SDP).
Hang Yu 0001, Edwin R. Hancock
openaire   +1 more source

Learning SVM Kernel with Semi-definite Programming

2005
It is well-known that the major task of the SVM approach lies in the selection of its kernel. The quality of kernel will determine the quality of SVM classifier directly. However, the best choice of a kernel for a given problem is still an open research issue. This paper presents a novel method which learns SVM kernel by transforming it into a standard
Shuzhong Yang, Siwei Luo
openaire   +1 more source

Design of Diamond and Circular Filters by Semi-definite Programming

2007 IEEE International Symposium on Circuits and Systems (ISCAS), 2007
A new design for linear phase diamond-shaped (DS) and circular-shaped (CS) 2D filters is developed. First, the frequency masks are efficiently constrained by 2D second-order trigonometric polynomials. Then semi-definite programming (SDP) of reasonably low dimension is employed to effectively express the filter specifications. Several numerical examples
T. Q. Hung, Hoang Duong Tuan, Truong Q. Nguyen   +2 more
openaire   +1 more source

Ensemble Pruning Via Semi-definite Programming

J. Mach. Learn. Res., 2006
Yi Zhang, S. Burer, W. Street
semanticscholar   +3 more sources