Sciweavers

482 search results - page 76 / 97
» A Linear-Time Graph Kernel
Sort
View
ASUNAM
2011
IEEE
13 years 9 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»
15 years 1 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
15 years 4 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
14 years 11 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
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
15 years 4 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...