Sciweavers

1507 search results - page 136 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
108
Voted
COLT
1999
Springer
15 years 6 months ago
Uniform-Distribution Attribute Noise Learnability
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
Nader H. Bshouty, Jeffrey C. Jackson, Christino Ta...
138
Voted
BMCBI
2010
97views more  BMCBI 2010»
15 years 2 months ago
Kinome-wide interaction modelling using alignment-based and alignment-independent approaches for kinase description and linear a
Background: Protein kinases play crucial roles in cell growth, differentiation, and apoptosis. Abnormal function of protein kinases can lead to many serious diseases, such as canc...
Maris Lapinsh, Jarl E. S. Wikberg
ATAL
2010
Springer
15 years 3 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
WEBI
2010
Springer
15 years 2 days ago
DSP: Robust Semi-supervised Dimensionality Reduction Using Dual Subspace Projections
High-dimensional data usually incur learning deficiencies and computational difficulties. We present a novel semi-supervised dimensionality reduction technique that embeds high-dim...
Su Yan, Sofien Bouaziz, Dongwon Lee
CAV
2009
Springer
206views Hardware» more  CAV 2009»
16 years 2 months ago
D-Finder: A Tool for Compositional Deadlock Detection and Verification
D-Finder tool implements a compositional method for the verification of component-based systems described in BIP language encompassing multi-party interaction. For deadlock detecti...
Saddek Bensalem, Marius Bozga, Thanh-Hung Nguyen, ...