Sciweavers

259 search results - page 18 / 52
» Graph Distances in the Data-Stream Model
Sort
View
COR
2007
99views more  COR 2007»
13 years 8 months ago
An improved algorithm for the p-center problem on interval graphs with unit lengths
The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider ...
T. C. Edwin Cheng, Liying Kang, C. T. Ng
SAGA
2007
Springer
14 years 2 months ago
Approximate Discovery of Random Graphs
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
Thomas Erlebach, Alexander Hall, Matús Miha...
ICML
2004
IEEE
14 years 9 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
BMCBI
2008
200views more  BMCBI 2008»
13 years 8 months ago
Defining functional distances over Gene Ontology
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...
Angela del Pozo, Florencio Pazos, Alfonso Valencia
ICCV
2011
IEEE
12 years 8 months ago
Robust Object Pose Estimation via Statistical Manifold Modeling
We propose a novel statistical manifold modeling approach that is capable of classifying poses of object categories from video sequences by simultaneously minimizing the intra-cla...
Liang Mei, Jingen Liu, Alfred Hero, Silvio Savares...