2294 search results - page 154 / 459 » From Path Graphs to Directed Path Graphs |
WALCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
WWW
2011
ACM
14 years 4 months ago
2011
ACM
In this paper, we use the structural and relational information on the Web to find entity-pages. Specifically, given a Web site and an entity-page (e.g., department and faculty ...
AICT
2006
IEEE
15 years 4 months ago
2006
IEEE
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
IFIP
2010
Springer
14 years 4 months ago
2010
Springer
We present a new approach to information flow control (IFC), ploits counterexample-guided abstraction refinement (CEGAR) technology. The CEGAR process is built on top of our existi...
112
click to vote
SDM
2011
SIAM
14 years 24 days ago
2011
SIAM
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...