7167 search results - page 747 / 1434 » Answer Set Programming |
189
click to vote
ICALP
2005
Springer
16 years 18 days ago
2005
Springer
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
172
click to vote
ICALP
2005
Springer
16 years 18 days ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
189
click to vote
ICALP
2004
Springer
16 years 14 days ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
218
click to vote
CVPR
2003
IEEE
16 years 11 days ago
2003
IEEE
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
184
click to vote
COMPIMAGE
2010
Springer
16 years 6 days ago
2010
Springer
We study how the quality of an image reconstructed by a binary tomographic algorithm depends on the direction of the observed object in the scanner, if only a few projections are a...