Sciweavers

1132 search results - page 73 / 227
» Similarity Graphs
Sort
View
AI
2010
Springer
14 years 10 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
SDM
2011
SIAM
269views Data Mining» more  SDM 2011»
14 years 19 days 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
COR
2006
93views more  COR 2006»
14 years 9 months ago
Solving capacitated arc routing problems using a transformation to the CVRP
A well known transformation by Pearn, Assad and Golden reduces a Capacitated Arc Routing Problem (CARP) into an equivalent Capacitated Vehicle Routing Problem (CVRP). However, tha...
Humberto Longo, Marcus Poggi de Aragão, Edu...
BMCBI
2010
86views more  BMCBI 2010»
14 years 10 months ago
Reaction graph kernels predict EC numbers of unknown enzymatic reactions in plant secondary metabolism
Background: Understanding of secondary metabolic pathway in plant is essential for finding druggable candidate enzymes. However, there are many enzymes whose functions are not yet...
Hiroto Saigo, Masahiro Hattori, Hisashi Kashima, K...
CVPR
2005
IEEE
15 years 12 months ago
Interactive Graph Cut Based Segmentation with Shape Priors
Interactive or semi-automatic segmentation is a useful alternative to pure automatic segmentation in many applications. While automatic segmentation can be very challenging, a sma...
Daniel Freedman, Tao Zhang