Sciweavers

11345 search results - page 1737 / 2269
» Foundations of Computer Science
Sort
View
EJC
2008
15 years 6 months ago
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
The motivation for this paper is three-fold. First, we study the connectivity properties of the homomorphism order of directed graphs, and more generally for relational structures...
Jan Foniok, Jaroslav Nesetril, Claude Tardif
EJIS
2008
49views more  EJIS 2008»
15 years 6 months ago
IT employment prospects: beyond the dotcom bubble
In the 1990s, enrollments grew rapidly in information systems (IS) and computer science. Then, beginning in 2000 and 2001, enrollments declined precipitously. This paper looks at ...
Raymond R. Panko
CC
2006
Springer
147views System Software» more  CC 2006»
15 years 6 months ago
Complexity of Ring Morphism Problems
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
Neeraj Kayal, Nitin Saxena
ESWA
2006
110views more  ESWA 2006»
15 years 6 months ago
XKey: A tool for the generation of identification keys
This paper presents the development of XKey, a tool for generating taxonomical identification keys by means of decision tree construction. The tool is based on an XML standard for...
Miguel Delgado Calvo-Flores, Waldo Fajardo Contrer...
IIE
2006
113views more  IIE 2006»
15 years 6 months ago
Gender and Programming Contests: Mitigating Exclusionary Practices
Individuals vary across many dimensions due to the effects of gender-based, personality, and cultural differences. Consequently, programming contests with a limited and rigid stru...
Maryanne Fisher, Anthony Cox
« Prev « First page 1737 / 2269 Last » Next »