Sciweavers

5158 search results - page 202 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
EJC
2010
15 years 6 months ago
Connectivity of chamber graphs of buildings and related complexes
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
Anders Björner, Kathrin Vorwerk
EJC
2006
15 years 6 months ago
Deza digraphs
As a generalization of Deza graphs, we introduce Deza digraphs and describe the basic theory of these graphs. We also prove the necessary and sufficient conditions when a weakly d...
Kaishun Wang, Yan-Quan Feng
JCT
2008
120views more  JCT 2008»
15 years 6 months ago
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
Tamás Király, Lap Chi Lau
JSC
2008
72views more  JSC 2008»
15 years 6 months ago
Flat matching
Abstract. Flat theory with sequence variables and flexible arity symbols has infinitary matching and unification type. Decidability of general unification is shown and a unificatio...
Temur Kutsia
TC
2008
15 years 6 months ago
A More Realistic Thinning Scheme for Call Admission Control in Multimedia Wireless Networks
A call admission control scheme named thinning scheme, which smoothly throttles the admission rates of calls according to their priorities and aims to provide multiple prioritized ...
Xian Wang, Pingzhi Fan, Yi Pan