3250 search results - page 471 / 650 » Parameterized Learning Complexity |
124
click to vote
ACMSE
2006
ACM
15 years 9 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
121
Voted
ECLIPSE
2006
ACM
15 years 9 months ago
2006
ACM
Frameworks provide means to reuse existing design and functionality, but first require developers to understand how to use them. Learning the correct usage of a framework can be ...
147
click to vote
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
126
click to vote
ICDAR
2005
IEEE
15 years 9 months ago
2005
IEEE
Digital repositories raise the need for an effective and efficient retrieval of the stored material. In this paper we propose the intensive application of intelligent techniques t...
134
click to vote
AIIA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Improving accuracy in Information Retrieval tasks via semantic information is a complex problem characterized by three main aspects: the document representation model, th...