Sciweavers

1605 search results - page 261 / 321
» On Partitional Labelings of Graphs
Sort
View
DC
2002
13 years 9 months ago
Restoration by path concatenation: fast recovery of MPLS paths
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
Yehuda Afek, Anat Bremler-Barr, Haim Kaplan, Edith...
JANCL
2002
113views more  JANCL 2002»
13 years 9 months ago
Canonicity and Completeness Results for Many-Valued Modal Logics
We prove frame determination results for the family of many-valued modal logics introduced by M. Fitting in the early '90s. Each modal language of this family is based on a H...
Costas D. Koutras, Christos Nomikos, Pavlos Peppas
APAL
2011
13 years 5 months ago
The provably total NP search problems of weak second order bounded arithmetic
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Ne...
ICCV
2005
IEEE
14 years 12 months ago
Incorporating Visual Knowledge Representation in Stereo Reconstruction
In this paper, we present a two-layer generative model that incorporates generic middle-level visual knowledge for dense stereo reconstruction. The visual knowledge is represented...
Adrian Barbu, Song Chun Zhu
CIKM
2009
Springer
14 years 4 months ago
SPIDER: a system for scalable, parallel / distributed evaluation of large-scale RDF data
RDF is a data model for representing labeled directed graphs, and it is used as an important building block of semantic web. Due to its flexibility and applicability, RDF has bee...
Hyunsik Choi, Jihoon Son, YongHyun Cho, Min Kyoung...