1813 search results - page 234 / 363 » Instance Pruning Techniques |
161
click to vote
CADE
2002
Springer
16 years 6 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
146
click to vote
ETRA
2010
ACM
16 years 1 months ago
2010
ACM
Selecting a graphical item by pointing with a computer mouse is a ubiquitous task in many graphical user interfaces. Several techniques have been suggested to facilitate this task...
169
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
150
click to vote
AIED
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we discuss how Artificial Intelligence (AI) techniques might be brought to bear in automatically recognizing “creative reasoning” in student e-discussions. An AI...
150
click to vote
ISVC
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. Linear systems and eigen-calculations on symmetric diagonally dominant matrices (SDDs) occur ubiquitously in computer vision, computer graphics, and machine learning. In ...