Sciweavers

2188 search results - page 106 / 438
» group 2007
Sort
View
EJC
2006
15 years 4 months ago
Invariant subspaces, duality, and covers of the Petersen graph
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
Aleksander Malnic, Primoz Potocnik
APAL
2005
117views more  APAL 2005»
15 years 4 months ago
About cut elimination for logics of common knowledge
The notions of common knowledge or common belief play an important role in several areas of computer science (e.g. distributed systems, communication), in philosophy, game theory,...
Luca Alberucci, Gerhard Jäger
ANOR
2002
87views more  ANOR 2002»
15 years 3 months ago
Review of Methods for Increasing Discrimination in Data Envelopment Analysis
We present a review of methods for increasing discrimination between efficient DMUs in Data Envelopment Analysis. These methods were classified into two groups: those that incorpor...
Lidia Angulo Meza, Marcos Pereira Estellita Lins
BC
2000
91views more  BC 2000»
15 years 3 months ago
Computational model of dot-pattern selective cells
Abstract. A computational model of a dot-pattern selective neuron is proposed. This type of neuron is found in the inferotemporal cortex of monkeys. It responds strongly to groups ...
Peter Kruizinga, Nikolai Petkov
IJAC
2007
116views more  IJAC 2007»
15 years 4 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil