1805 search results - page 204 / 361 » Functional programming with structured graphs |
138
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
116
click to vote
BMCBI
2006
15 years 1 months ago
2006
Background: In our previous studies, we found that the sites in prokaryotic genomes which are most susceptible to duplex destabilization under the negative superhelical stresses t...
111
click to vote
ICCV
2007
IEEE
16 years 3 months ago
2007
IEEE
In this paper, we take the human age and pose estimation problems as examples to study automatic designing regressor from training samples with uncertain nonnegative labels. First...
104
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
IFIP
2007
Springer
15 years 7 months ago
2007
Springer
Capability acquisition graphs (CAGs) provide a powerful framework for modeling insider threats, network attacks and system vulnerabilities. However, CAG-based security modeling sys...