834 search results - page 101 / 167 » Computing Minimal Models, Stable Models, and Answer Sets |
CORR
2008
Springer
14 years 12 months ago
2008
Springer
This paper addresses the problem of representing the set of repairs of a possibly inconsistent database by means of a disjunctive database. Specifically, the class of denial constr...
97
Voted
FOCS
2009
IEEE
15 years 6 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...
109
click to vote
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
Recognition of signs in sentences requires a training
set constructed out of signs found in continuous sentences.
Currently, this is done manually, which is a tedious process.
I...
103
click to vote
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
100
click to vote
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
We propose modeling images and related visual objects as bags of pixels or sets of vectors. For instance, gray scale images are modeled as a collection or bag of (X, Y, I) pixel v...