Sciweavers

314 search results - page 17 / 63
» Complete Problems for Dynamic Complexity Classes
Sort
View
BMCBI
2006
148views more  BMCBI 2006»
13 years 9 months ago
Predicting Class II MHC-Peptide binding: a kernel based approach using similarity scores
Background: Modelling the interaction between potentially antigenic peptides and Major Histocompatibility Complex (MHC) molecules is a key step in identifying potential T-cell epi...
Jesper Salomon, Darren R. Flower
ICML
2000
IEEE
14 years 10 months ago
Hierarchical Unsupervised Learning
We consider the problem of unsupervised classification of temporal sequences of facial expressions in video. This problem arises in the design of an adaptive visual agent, which m...
Shivakumar Vaithyanathan, Byron Dom
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
14 years 3 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
IJSI
2010
84views more  IJSI 2010»
13 years 8 months ago
Computational Complexity and Anytime Algorithm for Inconsistency Measurement
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
IJCAI
2003
13 years 11 months ago
Query rewriting and answering under constraints in data integration systems
In this paper we address the problem of query answering and rewriting in global-as-view data integration systems, when key and inclusion dependencies are expressed on the global i...
Andrea Calì, Domenico Lembo, Riccardo Rosat...