Sciweavers

176 search results - page 28 / 36
» Unbalanced Points and Vertices Problem
Sort
View
SIAMSC
2008
182views more  SIAMSC 2008»
14 years 9 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
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
14 years 9 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
CORR
2008
Springer
138views Education» more  CORR 2008»
14 years 9 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
CVPR
2007
IEEE
15 years 11 months ago
Face Recognition Using Kernel Ridge Regression
In this paper, we present novel ridge regression (RR) and kernel ridge regression (KRR) techniques for multivariate labels and apply the methods to the problem of face recognition...
Senjian An, Wanquan Liu, Svetha Venkatesh
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
14 years 9 months ago
Pattern Avoidance in Permutations: Linear and Cyclic Orders
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
Antoine Vella