Sciweavers

307 search results - page 14 / 62
» Finite locally-quasiprimitive graphs
Sort
View
ICMCS
2007
IEEE
157views Multimedia» more  ICMCS 2007»
14 years 4 months ago
A Semantic Content Analysis Model for Sports Video Based on Perception Concepts and Finite State Machines
In automatic video content analysis domain, the key challenges are how to recognize important objects and how to model the spatiotemporal relationships between them. In this paper...
Liang Bai, Songyang Lao, Gareth J. F. Jones, Alan ...
CSJM
2006
81views more  CSJM 2006»
13 years 10 months ago
Nash equilibria set computing in finite extended games
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Valeriu Ungureanu
DLOG
2011
13 years 1 months ago
Extracting Finite Sets of Entailments from OWL Ontologies
The canonical standard description logic reasoning service is classification, that is, the generation of the set of atomic subsumptions which are entailed by some ontology. While ...
Samantha Bail, Bijan Parsia, Ulrike Sattler
CSR
2009
Springer
14 years 1 months ago
The Reachability Problem over Infinite Graphs
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
Wolfgang Thomas
DM
2010
98views more  DM 2010»
13 years 10 months ago
Idomatic partitions of direct products of complete graphs
In this paper we give a full characterization of the idomatic partitions of the direct product of three complete graphs. We also show how to use such a characterization in order t...
Mario Valencia-Pabon