Sciweavers

561 search results - page 98 / 113
» Shortest-Path Kernels on Graphs
Sort
View
GMP
2006
IEEE
120views Solid Modeling» more  GMP 2006»
14 years 1 months ago
Spectral Sequencing Based on Graph Distance
The construction of linear mesh layouts has found various applications, such as implicit mesh filtering and mesh streaming, where a variety of layout quality criteria, e.g., span ...
Rong Liu, Hao Zhang 0002, Oliver van Kaick
ASUNAM
2011
IEEE
12 years 7 months ago
DisNet: A Framework for Distributed Graph Computation
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
Ryan Lichtenwalter, Nitesh V. Chawla
CDC
2009
IEEE
186views Control Systems» more  CDC 2009»
13 years 11 months ago
Distributed function and time delay estimation using nonparametric techniques
In this paper we analyze the problem of estimating a function from different noisy data sets collected by spatially distributed sensors and subject to unknown temporal shifts. We p...
Damiano Varagnolo, Gianluigi Pillonetto, Luca Sche...
INFOCOM
2009
IEEE
14 years 2 months ago
Sensor Network Localization Using Sensor Perturbation
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
Yuanchen Zhu, Steven J. Gortler, Dylan Thurston
AISC
2008
Springer
13 years 9 months ago
Extending Graphical Representations for Compact Closed Categories with Applications to Symbolic Quantum Computation
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
Lucas Dixon, Ross Duncan