Sciweavers

1883 search results - page 76 / 377
» Ordered theta graphs
Sort
View
MICS
2010
124views more  MICS 2010»
13 years 2 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
CVPR
2008
IEEE
14 years 9 months ago
(BP)2: Beyond pairwise Belief Propagation labeling by approximating Kikuchi free energies
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...
Ifeoma Nwogu, Jason J. Corso
WWW
2007
ACM
14 years 8 months ago
Random web crawls
This paper proposes a random Web crawl model. A Web crawl is a (biased and partial) image of the Web. This paper deals with the hyperlink structure, i.e. a Web crawl is a graph, w...
Toufik Bennouas, Fabien de Montgolfier
SEMWEB
2001
Springer
14 years 6 days ago
On the Integration of Topic Maps and RDF data
Abstract. Topic Maps and RDF are two independently developed paradigms and standards for the representation, interchange, and exploitation of model-based data on the web. Each para...
Martin S. Lacher, Stefan Decker
CAV
2012
Springer
270views Hardware» more  CAV 2012»
11 years 10 months ago
Automated Termination Proofs for Java Programs with Cyclic Data
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
Marc Brockschmidt, Richard Musiol, Carsten Otto, J...