Sciweavers

2479 search results - page 194 / 496
» Quantum complexity theory
Sort
View
FCT
2009
Springer
16 years 1 months ago
Computing Role Assignments of Chordal Graphs
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
Pim van 't Hof, Daniël Paulusma, Johan M. M. ...
HT
2009
ACM
16 years 1 months ago
Comparing spatial hypertext collections
This paper proposes an approach to comparison of spatial hypertext collections which avoids becoming entangled in complexities of version management and merging. We also propose a...
J. Nathan Matias, David P. Williams
RECSYS
2009
ACM
16 years 1 months ago
Recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
Aditya G. Parameswaran, Hector Garcia-Molina
HICSS
2007
IEEE
114views Biometrics» more  HICSS 2007»
16 years 1 months ago
Organizational Assimilation of Vertical Standards: An Integrative Model
Vertical standards are complex networked technologies whose assimilation is subject to extensive interorganizational dependence and network effects. Classical theories of diffusio...
Rubén A. Mendoza, T. Ravichandran
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
16 years 28 days ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
Tao Gong, Andrew Tuson