Sciweavers

3267 search results - page 426 / 654
» Generalized quasirandom graphs
Sort
View
JCT
2010
114views more  JCT 2010»
15 years 5 months ago
An almost quadratic bound on vertex Folkman numbers
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
Andrzej Dudek, Vojtech Rödl
JITECH
2010
106views more  JITECH 2010»
15 years 5 months ago
Patterns and structures of intra-organizational learning networks within a knowledge-intensive organization
This paper employs the network perspective to study patterns and structures of intraorganizational learning networks. The theoretical background draws from cognitive theories, the...
Miha Skerlavaj, Vlado Dimovski, Kevin C. Desouza
KBSE
2010
IEEE
15 years 5 months ago
Analyzing security architectures
We present a semi-automated approach, Secoria, for analyzing a security runtime architecture for security and for conformance to an object-oriented implementation. Typecheckable a...
Marwan Abi-Antoun, Jeffrey M. Barnes
LATIN
2010
Springer
15 years 5 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese
ICIP
2010
IEEE
15 years 4 months ago
Learning image similarities via Probabilistic Feature Matching
In this paper, we propose a novel image similarity learning approach based on Probabilistic Feature Matching (PFM). We consider the matching process as the bipartite graph matchin...
Ziming Zhang, Ze-Nian Li, Mark S. Drew