Sciweavers

2489 search results - page 213 / 498
» On the Subgroup Distance Problem
Sort
View
ICML
2010
IEEE
15 years 5 months ago
Metric Learning to Rank
We study metric learning as a problem of information retrieval. We present a general metric learning algorithm, based on the structural SVM framework, to learn a metric such that ...
Brian McFee, Gert R. G. Lanckriet
CORR
2010
Springer
81views Education» more  CORR 2010»
15 years 4 months ago
Relaxation-based coarsening and multiscale graph organization
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
Dorit Ron, Ilya Safro, Achi Brandt
JCC
2006
78views more  JCC 2006»
15 years 4 months ago
Software news and updates carma: A molecular dynamics analysis program
: A computer program has been developed to aid the analysis of molecular dynamics trajectories. The program is tuned for macromolecular large-scale problems and supports features s...
Nicholas M. Glykos
SIAMDM
2008
50views more  SIAMDM 2008»
15 years 4 months ago
Real Number Channel Assignments for Lattices
We consider the problem of assigning a numerical channel to each transmitter in a large regular array such that multiple levels of interference, which depend on the distance betwe...
Jerrold R. Griggs, Xiaohua Teresa Jin
DAM
2002
67views more  DAM 2002»
15 years 4 months ago
Optimal arrangement of data in a tree directory
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
Malwina J. Luczak, Steven D. Noble