Sciweavers

29 search results - page 5 / 6
» Entire regularization paths for graph data
Sort
View
172
Voted
ICRA
2010
IEEE
148views Robotics» more  ICRA 2010»
14 years 11 months ago
Global reachability and path planning for planetary exploration with montgolfiere balloons
Aerial vehicles are appealing systems for possible future exploration of planets and moons such as Venus and Titan, because they combine extensive coverage with highresolution data...
Lars Blackmore, Yoshiaki Kuwata, Michael T. Wolf, ...
154
Voted
FOCS
2009
IEEE
15 years 8 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
139
Voted
SDM
2011
SIAM
269views Data Mining» more  SDM 2011»
14 years 4 months ago
Semi-Supervised Convolution Graph Kernels for Relation Extraction
Extracting semantic relations between entities is an important step towards automatic text understanding. In this paper, we propose a novel Semi-supervised Convolution Graph Kerne...
Xia Ning, Yanjun Qi
137
Voted
ECCB
2005
IEEE
15 years 6 months ago
A query language for biological networks
Many areas of modern biology are concerned with the management, storage, visualization, comparison, and analysis of networks. For instance, networks are used to model signal trans...
Ulf Leser
120
Voted
LICS
2005
IEEE
15 years 6 months ago
Uniform Distributed Synthesis
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
Bernd Finkbeiner, Sven Schewe