Sciweavers

1883 search results - page 32 / 377
» Ordered theta graphs
Sort
View
ACST
2006
13 years 9 months ago
An efficient search algorithm for partially ordered sets
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
Yan Chen
ISSAC
2007
Springer
112views Mathematics» more  ISSAC 2007»
14 years 1 months ago
G-graphs for the cage problem: a new upper bound
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
Alain Bretto, Luc Gillibert
ATVA
2004
Springer
115views Hardware» more  ATVA 2004»
13 years 11 months ago
First-Order LTL Model Checking Using MDGs
In this paper, we describe a first-order linear time temporal logic (LTL) model checker based on multiway decision graphs (MDG). We developed a first-order temporal language, LMDG ...
Fang Wang, Sofiène Tahar, Otmane Aït M...
CVPR
2008
IEEE
14 years 9 months ago
Exact inference in multi-label CRFs with higher order cliques
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...
Srikumar Ramalingam, Pushmeet Kohli, Karteek Alaha...
SDM
2012
SIAM
297views Data Mining» more  SDM 2012»
11 years 10 months ago
A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis
The Knowledge Discovery Toolbox (KDT) enables domain experts to perform complex analyses of huge datasets on supercomputers using a high-level language without grappling with the ...
Adam Lugowski, David M. Alber, Aydin Buluç,...