2430 search results - page 425 / 486 » Computing Tutte Polynomials |
180
click to vote
CADE
2009
Springer
16 years 28 days ago
2009
Springer
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
149
click to vote
ATAL
2009
Springer
16 years 22 days ago
2009
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...
169
click to vote
COMPGEOM
2009
ACM
16 years 20 days ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
173
click to vote
CVPR
2007
IEEE
16 years 15 days ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
130
click to vote
MLG
2007
Springer
16 years 8 days ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...