Sciweavers

1053 search results - page 9 / 211
» On k-Path Covers and their applications
Sort
View
LOGCOM
2010
123views more  LOGCOM 2010»
13 years 7 months ago
The Hyper Tableaux Calculus with Equality and an Application to Finite Model Computation
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
Peter Baumgartner, Ulrich Furbach, Björn Pelz...
ISPAN
2005
IEEE
14 years 2 months ago
Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications
Abstract—In real networks, disjoint paths are needed for providing protection against single link/node failure. When disjoint paths cannot be found, an alternative solution is to...
Bing Yang, Mei Yang, Jianping Wang, S. Q. Zheng
JDA
2008
84views more  JDA 2008»
13 years 8 months ago
Red-blue covering problems and the consecutive ones property
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...
Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastia...
ACMSE
2007
ACM
14 years 24 days ago
Hierarchical land cover information retrieval in object-oriented remote sensing image databases with native queries
Classification and change detection of land cover types in the remotely sensed images is one of the major applications in remote sensing. This paper presents a hierarchical framew...
Jiang Li
CSR
2008
Springer
13 years 10 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma