Sciweavers

1722 search results - page 117 / 345
» Variables in Concept Graphs
Sort
View
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
15 years 10 months ago
Mining significant graph patterns by leap search
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
Xifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu
RSA
2008
123views more  RSA 2008»
14 years 9 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
CAV
2004
Springer
99views Hardware» more  CAV 2004»
15 years 3 months ago
Range Allocation for Separation Logic
Abstract. Separation Logic consists of a Boolean combination of predicates of the form vi ≥ vj +c where c is a constant and vi, vj are variables of some ordered infinite type li...
Muralidhar Talupur, Nishant Sinha, Ofer Strichman,...
ICCS
2009
Springer
15 years 4 months ago
Semantic Search - Using Graph-Structured Semantic Models for Supporting the Search Process
Semantic search attempts to go beyond the current state of the art in information access by addressing information needs on the semantic level, i.e. considering the meaning of user...
Thanh Tran, Peter Haase, Rudi Studer
ACSC
2004
IEEE
15 years 1 months ago
Network Robustness and Graph Topology
Two important recent trends in military and civilian communications have been the increasing tendency to base operations around an internal network, and the increasing threats to ...
Anthony H. Dekker, Bernard D. Colbert