Sciweavers

1983 search results - page 31 / 397
» Competitive graph searches
Sort
View
FLAIRS
2007
15 years 2 months ago
Inference of Edge Replacement Graph Grammars
We describe an algorithm and experiments for inference of edge replacement graph grammars. This method generates candidate recursive graph grammar productions based on isomorphic ...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
ICML
2007
IEEE
16 years 18 days ago
Learning from interpretations: a rooted kernel for ordered hypergraphs
The paper presents a kernel for learning from ordered hypergraphs, a formalization that captures relational data as used in Inductive Logic Programming (ILP). The kernel generaliz...
Gabriel Wachman, Roni Khardon
WWW
2001
ACM
16 years 14 days ago
Interactive Web Search by Graphical Query Refinement
We propose a new Web search system that helps users clarify their information needs through interaction. The system represents the user's information needs using a query grap...
Junji Tomita, Gen-ichiro Kikui
TCS
2008
14 years 11 months ago
An annotated bibliography on guaranteed graph searching
Graph searching encompasses a wide variety of combinatorial problems related to the problem of capturing a fugitive residing in a graph using the minimum number of searchers. In t...
Fedor V. Fomin, Dimitrios M. Thilikos
IPL
2010
79views more  IPL 2010»
14 years 10 months ago
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
Christophe Crespelle, Philippe Gambette