Sciweavers

724 search results - page 105 / 145
» Some Structural Complexity Aspects of Neural Computation
Sort
View
ATAL
2010
Springer
14 years 11 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
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...
Albert Xin Jiang, MohammadAli Safari
BMCBI
2007
155views more  BMCBI 2007»
14 years 9 months ago
ProCMD: a database and 3D web resource for protein C mutants
Background: Activated Protein C (ProC) is an anticoagulant plasma serine protease which also plays an important role in controlling inflammation and cell proliferation. Several mu...
Pasqualina D'Ursi, Francesca Marino, Andrea Caprer...
ENTCS
2007
110views more  ENTCS 2007»
14 years 9 months ago
A Bayesian Model for Event-based Trust
The application scenarios envisioned for ‘global ubiquitous computing’ have unique requirements that are often incompatible with traditional security paradigms. One alternativ...
Mogens Nielsen, Karl Krukow, Vladimiro Sassone
DAC
2009
ACM
15 years 10 months ago
Debugging strategies for mere mortals
Recent improvements in design verification strive to automate error detection and greatly enhance engineers' ability to detect functional errors. However, the process of diag...
Valeria Bertacco
ICDM
2008
IEEE
168views Data Mining» more  ICDM 2008»
15 years 4 months ago
Measuring Proximity on Graphs with Side Information
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
Hanghang Tong, Huiming Qu, Hani Jamjoom