Sciweavers

70 search results - page 2 / 14
» Frequency-distance constraints with large distances
Sort
View
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
DBPL
1999
Springer
122views Database» more  DBPL 1999»
13 years 10 months ago
A Representation Independent Language for Planar Spatial Databases with Euclidean Distance
Linear constraint databases and query languages are appropriate for spatial database applications. Not only the data model is natural to represent a large portion of spatial data s...
Gabriel M. Kuper, Jianwen Su
JMLR
2010
113views more  JMLR 2010»
13 years 17 days ago
Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
Kaname Kojima, Eric Perrier, Seiya Imoto, Satoru M...
ICML
2007
IEEE
14 years 6 months ago
Learning distance function by coding similarity
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
Aharon Bar-Hillel, Daphna Weinshall
ICML
2008
IEEE
14 years 6 months ago
Fast solvers and efficient implementations for distance metric learning
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...
Kilian Q. Weinberger, Lawrence K. Saul