Sciweavers

649 search results - page 98 / 130
» A Graph Pebbling Algorithm on Weighted Graphs
Sort
View
INFOCOM
2007
IEEE
14 years 3 months ago
Towards Topology Aware Networks
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
Christos Gkantsidis, Gagan Goel, Milena Mihail, Am...
ICASSP
2010
IEEE
13 years 9 months ago
Graph-based regularization for spherical signal interpolation
This paper addresses the problem of the interpolation of 2-d spherical signals from non-uniformly sampled and noisy data. We propose a graph-based regularization algorithm to impr...
Tamara Tosic, Tamara Frossard
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 9 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
MOBIHOC
2007
ACM
14 years 8 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
SAC
2009
ACM
14 years 3 months ago
On a discretizable subclass of instances of the molecular distance geometry problem
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
Carlile Lavor, Leo Liberti, Antonio Mucherino, Nel...